65664

Appears in sequences

• a(n) = (2^n + 2^[ n/2 ] )/2.at n=15A001445
• 6th powers written backwards.at n=6A002138
• Cubes written backwards.at n=35A004165
• Coordination sequence for D_4 lattice.at n=16A007900
• Number of binary codes of length 5 with n words.at n=12A034190
• Number of binary codes of length 5 with n words.at n=20A034190
• Number of binary codes (not necessarily linear) of length n with 12 words.at n=4A034207
• Irregular triangle read by rows: T(n,k) = number of binary codes of length n with k words (n >= 0, 0 <= k <= 2^n); also number of 0/1-polytopes with vertices from the unit n-cube; also number of inequivalent Boolean functions of n variables with exactly k nonzero values under action of Jevons group.at n=48A039754
• Irregular triangle read by rows: T(n,k) = number of binary codes of length n with k words (n >= 0, 0 <= k <= 2^n); also number of 0/1-polytopes with vertices from the unit n-cube; also number of inequivalent Boolean functions of n variables with exactly k nonzero values under action of Jevons group.at n=56A039754
• Numbers k such that neither 4 nor 9 divides binomial(2k-1,k) (almost certainly finite).at n=28A051404
• a(n) = n^n written backwards.at n=5A062018
• Powers of 6 written backwards.at n=6A071588
• Numbers k such that 2k-1 divides 2^k-1.at n=30A081856
• Structured triakis octahedral numbers (vertex structure 4).at n=26A100171
• a(n) = 4*n*(floor(n^2/2)+1). For n >= 3, this is the number of directed Hamiltonian paths on the n-prism graph.at n=32A124350
• Powers of 6 written backwards and sorted.at n=6A134112
• Number of (directed) Hamiltonian paths in the n-Möbius ladder graph.at n=29A137883
• a(n) = 2^(2n) + 2^(n-1).at n=7A164051
• Numbers of the form A019434(i) + A000668(j).at n=23A168335
• a(n) = n^8*(n^9 + 1)/2.at n=2A170781