33553

Appears in sequences

• Numbers whose set of base-11 digits is {2,3}.at n=41A032811
• Expansion of x*(1-2*x-x^2)/( (1-x)*(1+x)*(1-3*x+x^2)).at n=14A107387
• a(n) = denominator of Atkin polynomials A_n(j) evaluated at j = 1728.at n=45A145295
• A product of consecutive doubled Fibonacci numbers.at n=11A166536
• Numerators b(n) of Pythagorean approximations b(n)/a(n) to 1/2.at n=11A195548
• Number of n X 1 0..4 arrays with each element x equal to the number its horizontal and vertical neighbors equal to 2,0,1,3,4 for x=0,1,2,3,4.at n=22A195971
• a(n) = 7*a(n-1) - a(n-2) - 4 with a(1)=1, a(2)=3.at n=6A206351
• a(n) = F(n)^2 - F(n-1)^2 or F(n+1) * F(n-2) where F(n) = A000045(n), the Fibonacci numbers.at n=12A226205
• a(n) = a(n-1) + a(n-2) + a(n-3), with a(0) = a(1) = 1, a(2) = 0.at n=25A236165
• Triangle read by rows: T(n,k) is the coefficient A_k in the transformation Sum_{k=0..n} x^k = Sum_{k=0..n} A_k*(x+2*(-1)^k)^k.at n=31A249266
• Integers k such that A072473(k) = A072473(k+1) = A072473(k+2) = A072473(k+3).at n=6A255172
• T(n,k)=Number of (n+1)X(k+1) arrays of permutations of 0..(n+1)*(k+1)-1 with each element having index change +-(.,.) 0,0 1,2 or 2,2.at n=37A264017
• Number of (2+1) X (n+1) arrays of permutations of 0..n*3+2 with each element having index change +-(.,.) 0,0 1,2 or 2,2.at n=7A264018
• Numbers k with digits 3 and 5 only.at n=36A284379