33565

Appears in sequences

• Expansion of 1/((1-x) * (1-6*x) * (1-11*x)).at n=4A016247
• Triangle T(n,k) read by rows: T(n, k) = (m*n - m*k + 1)*T(n - 1, k - 1) + (5*k - 4)*(m*k - (m - 1))*T(n - 1, k) where m = 0.at n=23A166973
• Number of 3 X n 0..3 arrays with no element equal to zero plus the sum of elements to its left or two plus the sum of the elements above it or one plus the sum of the elements diagonally to its northwest, modulo 4.at n=30A239987
• Numbers k such that 10^k - 201 is prime.at n=8A278470
• Let D = A042948(n) be the n-th positive integer congruent to 0 or 1 mod 4, then a(n) = b(D) := Sum_{i=1..D} Kronecker(D,i)*i^2, where Kronecker(D,i) is the Kronecker symbol.at n=24A329649
• a(n) = F(n+5) * F(n+2) - 12 * (-1)^n where F(n) = A000045(n) are the Fibonacci numbers.at n=8A343008
• Number of partitions of n into 9 or more parts.at n=32A347545