33063

Appears in sequences

• Numbers that are the sum of 8 nonzero 8th powers.at n=36A003386
• Number of base 13 circular n-digit numbers with adjacent digits differing by 4 or less.at n=5A125350
• G.f.: A(x) = exp( Sum_{n>=1} 3*A038500(n) * x^n/n ), where A038500 is the highest power of 3 dividing n.at n=38A161809
• Number of nX7 0..1 arrays avoiding 0 0 0 and 0 1 0 horizontally and 0 1 1 and 1 0 1 vertically.at n=3A207728
• T(n,k)=Number of nXk 0..1 arrays avoiding 0 0 0 and 0 1 0 horizontally and 0 1 1 and 1 0 1 vertically.at n=48A207729
• Number of 4Xn 0..1 arrays avoiding 0 0 0 and 0 1 0 horizontally and 0 1 1 and 1 0 1 vertically.at n=6A207731
• Number of (n+2) X (5+2) 0..3 arrays with every 3 X 3 subblock row and column sum not equal to 0 3 5 6 or 7 and every 3 X 3 diagonal and antidiagonal sum equal to 0 3 5 6 or 7.at n=22A252251
• Number of length n+6 0..2 arrays with at most one downstep in every n consecutive neighbor pairs.at n=7A255113