62064

Appears in sequences

• a(n) = floor(tau*a(n-2)) + a(n-1) with a(0)=0 and a(1)=1.at n=20A005833
• Numbers whose set of base-13 digits is {2,3}.at n=36A032813
• Least m such that sqrt(m) has a period 2n continued fraction expansion whose palindrome part concatenates to a palindromic prime.at n=20A072135
• a(n) = A014486(A122234(n)).at n=5A122235
• a(n) = the smallest k such that k^2+1 = p*A002144(n)^2, p prime of A002144 .at n=18A174492
• Shifts 9 places left under Euler transform with a(0)=0 and a(n)=1 for n<9.at n=40A218026
• T(n,k)=Equals one maps: number of nXk binary arrays indicating the locations of corresponding elements equal to exactly one of their horizontal, diagonal and antidiagonal neighbors in a random 0..3 nXk array.at n=37A221632
• Equals one maps: number of 2 X n binary arrays indicating the locations of corresponding elements equal to exactly one of their horizontal, diagonal and antidiagonal neighbors in a random 0..3 2 X n array.at n=7A221633
• Number of groups of order prime(n)^6.at n=32A232106
• Number of (n+1)X(2+1) 0..6 arrays with every 2X2 subblock having the sum of the squares of all six edge and diagonal differences equal to 35.at n=3A233898
• Number of (n+1)X(4+1) 0..6 arrays with every 2X2 subblock having the sum of the squares of all six edge and diagonal differences equal to 35.at n=1A233900
• T(n,k)=Number of (n+1)X(k+1) 0..6 arrays with every 2X2 subblock having the sum of the squares of all six edge and diagonal differences equal to 35 (35 maximizes T(1,1)).at n=11A233903
• T(n,k)=Number of (n+1)X(k+1) 0..6 arrays with every 2X2 subblock having the sum of the squares of all six edge and diagonal differences equal to 35 (35 maximizes T(1,1)).at n=13A233903
• a(n) = 3*p^2+39*p+344+24*gcd(p-1,3)+11*gcd(p-1,4)+2*gcd(p-1,5), where p = prime(n).at n=32A269749
• Deep factorization of n, A300560, converted from binary to decimal. (Binary digits obtained by recursively replacing each factor p^e with [primepi(p) [e]], then '[' = 1, ']' = 0.)at n=24A300561
• a(n) = n! * [x^n] 1/(1 + x*exp(n*x)).at n=6A302398
• Product_{n>=1} (1 + a(n) * x^n) = 1 + Sum_{n>=1} n^3 * x^n.at n=12A359265
• Number of Hamiltonian paths in the n-flower graph.at n=7A387456