33216

Appears in sequences

• Numbers n such that n divides the (right) concatenation of all numbers <= n written in base 11 (most significant digit on right).at n=19A029504
• Numbers having four 0's in base 8.at n=27A043424
• T(n,2), array T as in A054126.at n=11A054128
• Triangle T(n,k), n >= 1, giving number of prime unoriented alternating links with n crossings and k components.at n=61A059739
• a(n) = n^5 + n^3 - n^2.at n=8A133072
• Number of ON cells at n-th stage of three-dimensional version of the cellular automaton A160410, using cubes.at n=18A160428
• Number of "ON" cubic cells at n-th stage in simple 3-dimensional cellular automaton: a(n) = A160428(n)/8.at n=36A161342
• a(n) = 4*a(n-1) + 4*a(n-2) for n > 1; a(0) = 1, a(1) = 14.at n=6A164540
• Number of 4-step left-handed knight's tours (moves only out two, left one) on an n X n board summed over all starting positions.at n=33A187174
• Number of 3 X n arrays of the minimum value of corresponding elements and their horizontal, diagonal, diagonal or antidiagonal neighbors in a random, but sorted with lexicographically nondecreasing rows and nonincreasing columns, 0..2 3 X n array.at n=13A219916
• a(n) is the least integer k such that 2^k - 1 has at least 10^n digits.at n=4A227689
• Number of nX6 0..3 arrays with no element equal to the sum of elements to its left or the sum of elements above it or the sum of the elements diagonally to its northwest or the sum of the elements antidiagonally to its northeast, modulo 4.at n=3A240248
• T(n,k)=Number of nXk 0..3 arrays with no element equal to the sum of elements to its left or the sum of the elements above it or the sum of the elements diagonally to its northwest or the sum of the elements antidiagonally to its northeast, modulo 4.at n=39A240250
• Number of 4Xn 0..3 arrays with no element equal to the sum of elements to its left or the sum of the elements above it or the sum of the elements diagonally to its northwest or the sum of the elements antidiagonally to its northeast, modulo 4.at n=5A240253
• Number of (1+1)X(n+1) 0..1 arrays with nondecreasing x(i,j)+x(i,j-1) in the i direction and nondecreasing min(x(i,j),x(i-1,j)) in the j direction.at n=10A250730
• Number of (n+2)X(n+2) 0..3 arrays with every 3X3 subblock row and column sum equal to 0 2 3 6 or 7 and every 3X3 diagonal and antidiagonal sum not equal to 0 2 3 6 or 7.at n=6A252106
• Number of (n+2) X (7+2) 0..3 arrays with every 3 X 3 subblock row and column sum equal to 0 2 3 6 or 7 and every 3 X 3 diagonal and antidiagonal sum not equal to 0 2 3 6 or 7.at n=6A252113
• Number of permutations in S_n that avoid the pattern 31524.at n=8A256196
• a(n) = (1/4)*(n^2 - 2*n)^2 + (9/4)*(n^2 - 2*n) + 6.at n=19A294070
• Expansion of x * (d/dx) Product_{k>=0} 1/(1 - x^(2^k)).at n=48A304909