39372

Appears in sequences

• Numbers that are the sum of 8 positive 9th powers.at n=17A003397
• Number of (undirected) Hamiltonian paths in n-Moebius ladder.at n=34A020875
• Number of (s(0), s(1), ..., s(n)) such that every s(i) is a nonnegative integer, s(0) = 0, s(1) = 1 = s(n), |s(i) - s(i-1)| <= 1 for i >= 2, |s(2) - s(1)| = 1, |s(3) - s(2)| = 1 if s(2) = 1. Also T(n,n-1), where T is the array in A026268.at n=11A026270
• Denominators of continued fraction convergents to sqrt(290).at n=3A041545
• Base-9 palindromes that start with 6.at n=20A043033
• Obtainable by applying +, * and exponentiation to its own digits.at n=36A046469
• a(n) = Sum_{d|3} phi(d)*n^(3/d).at n=34A054602
• Numbers k such that k | sigma_8(k).at n=24A055712
• Number of (n+1)X(n+1) binary arrays with every 2X2 subblock determinant equal to exactly one or two horizontal and vertical neighbor 2X2 subblock determinants.at n=4A186894
• Number of (n+1) X 6 binary arrays with every 2 X 2 subblock determinant equal to exactly one or two horizontal and vertical neighbor 2 X 2 subblock determinants.at n=4A186898
• T(n,k)=Number of (n+1)X(k+1) binary arrays with every 2X2 subblock determinant equal to exactly one or two horizontal and vertical neighbor 2X2 subblock determinants.at n=40A186902
• Number of (n+2)X(1+2) 0..2 arrays with every 3X3 subblock row, column, diagonal and antidiagonal sum not equal to 1 2 or 5.at n=6A252598
• Number of (n+2)X(7+2) 0..2 arrays with every 3X3 subblock row, column, diagonal and antidiagonal sum not equal to 1 2 or 5.at n=0A252604
• T(n,k)=Number of (n+2)X(k+2) 0..2 arrays with every 3X3 subblock row, column, diagonal and antidiagonal sum not equal to 1 2 or 5.at n=21A252605
• T(n,k)=Number of (n+2)X(k+2) 0..2 arrays with every 3X3 subblock row, column, diagonal and antidiagonal sum not equal to 1 2 or 5.at n=27A252605
• Define a set of generalized Syracuse sequences starting with x(1)=2*n+1 a positive odd integer, if x(i) is odd prime set x(i+1)=67*x(i)+1, if x(i) is odd not prime set x(i+1)=3*x(i)+1 and if x(i) is even then set x(i+1)=x(i)/2. Then a(n) is the first index i > 1 at which x(i) reaches 1.at n=31A300286
• Number of (undirected) Hamiltonian paths on the n-prism graph.at n=31A308137
• Numbers k such that 351*2^k+1 is prime.at n=38A323032
• Averages k of twin primes such that the sum (with multiplicity) of prime factors of k-1, k and k+1 is a prime power (but not a prime).at n=0A340062