66060288

Appears in sequences

• Number of divisors of k as k runs through sequence of distinct values of LCM(1,..,n).at n=31A056795
• a(1) = 1; a(n) is the smallest multiple of a(n-1) not divisible by 10 which is greater than the digit reversal of a(n-1). In case R(a(n-1)) < a(n-1) then a(n) = 2*a(n-1).at n=20A076086
• Refactorable numbers x, such that quotient x/A000005(x) equals a power of 2.at n=25A078541
• a(n) = (n^3 + n^2)*8^n.at n=5A129008
• Determinants of n-times-n matrices M of the form M[i,j] = 2^(i*j).at n=3A158506
• Expansion of (1-x+4*x^2)/(1-2*x)^2.at n=21A167667
• Number of solutions to Sum_{i=1..n} x_i^2 == 1 (mod 4) with x_i in 0..3.at n=13A229136
• Number of solutions to gcd(u^2 + v^2 + w^2 + x^2 + y^2 + z^2, n) = 1 with u, v, w, x, y, z in [0,n-1].at n=23A238534
• Number of n X 2 0..2 arrays with some element plus some horizontally or antidiagonally adjacent neighbor totalling two exactly once.at n=10A268898
• Triangle read by rows: T(n, k) = Sum_{i=1..n-k} inverse-q-binomial(n-k-1, i-1) * q-binomial(n-2+i, n-2) for 0 < k < n with initial values T(n, 0) = 0 for n > 0 and T(n, n) = 1 for n >= 0, here q = 2.at n=30A355401
• Numbers that can be written in two or more ways as the product of three divisors greater than 1 such that the number in binary is contained in the string concatenation of the divisors in binary.at n=37A356143
• a(n) = 2^(4*n-4)*(2^n-1).at n=6A371193