33265
domain: N
Appears in sequences
- Number of decimal digits in n-th Mersenne prime.at n=28A028335
- Numbers n such that n divides the (right) concatenation of all numbers <= n written in base 3 (most significant digit on right).at n=9A029496
- Number of partitions of n into parts not of the form 15k, 15k+4 or 15k-4. Also number of partitions with at most 3 parts of size 1 and differences between parts at distance 6 are greater than 1.at n=44A035958
- a(n)=a(n-1)+a(n-2)-d, where d=a(n/4) if 4 divides n, else d=0; 2 initial terms.at n=23A050194
- Start with 1 and repeatedly reverse the digits and add 66 to get the next term.at n=12A118200
- Number of digits in n-th even superperfect number A061652(n).at n=28A138883
- Number of walks within N^3 (the first octant of Z^3) starting at (0,0,0) and consisting of n steps taken from {(-1, -1, 0), (-1, 0, 1), (1, -1, 0), (1, 0, -1), (1, 1, 0)}.at n=9A149208
- Number of "ON" cubic cells at n-th stage in simple 3-dimensional cellular automaton: a(n) = A160428(n)/8.at n=37A161342
- Number of binary strings of length n with no substrings equal to 0000 or 0111.at n=18A164391
- T(n,k)=Number of (n+2)X(k+2) arrays of permutations of 0..(n+2)*(k+2)-1 with each element moved 0 or 1 knight moves and equal numbers of elements advancing and retreating in the array numbered in row major order.at n=6A263706
- Number of (1+2)X(n+2) arrays of permutations of 0..n*3+5 with each element moved 0 or 1 knight moves and equal numbers of elements advancing and retreating in the array numbered in row major order.at n=3A263707
- Poincaré series for hyperbolic reflection group with Coxeter diagram shown in Comments.at n=22A265049
- Number of nX5 0..1 arrays with every element equal to 2 or 3 king-move adjacent elements, with upper left element zero.at n=15A297811