38064

Appears in sequences

• Low-temperature susceptibility expansion for square lattice (Potts model, q=4).at n=9A057379
• a(1) = 1, a(n) = Sum_{k=1..pi(n)} a(n-k) for n > 1, where pi(n) is the number of primes less than or equal to n.at n=17A123341
• Largest k such that k! < 2^(2^n).at n=19A152909
• Triangle read by rows: T(n, k) = (2^(n-k)*3^k + 2^k*3^(n-k))*binomial(n, k).at n=37A154692
• Triangle read by rows: T(n, k) = (2^(n-k)*3^k + 2^k*3^(n-k))*binomial(n, k).at n=43A154692
• a(n) = 1521*n^2 + 39.at n=5A158768
• a(n) = 25*n^2 + n.at n=38A173089
• Values of the difference d for 6 primes in geometric-arithmetic progression with the minimal sequence {7*7^j + j*d}, j = 0 to 5.at n=18A209205
• Values of the difference d for 7 primes in geometric-arithmetic progression with the minimal sequence {7*7^j + j*d}, j = 0 to 6.at n=2A209206
• a(n) = number of n-lettered words in the alphabet {1, 2, 3, 4} with as many occurrences of the substring (consecutive subword) [1, 2] as of [2, 1].at n=8A211307
• Number of (n+1) X (1+1) 0..5 arrays with every 2 X 2 subblock having its diagonal sum differing from its antidiagonal sum by 5, with no adjacent elements equal (constant-stress tilted 1 X 1 tilings).at n=6A235179
• Number of (n+1) X (7+1) 0..5 arrays with every 2 X 2 subblock having its diagonal sum differing from its antidiagonal sum by 5, with no adjacent elements equal (constant-stress tilted 1 X 1 tilings).at n=0A235185
• T(n,k) is the number of (n+1) X (k+1) 0..5 arrays with every 2 X 2 subblock having its diagonal sum differing from its antidiagonal sum by 5, with no adjacent elements equal (constant-stress tilted 1 X 1 tilings).at n=21A235186
• T(n,k) is the number of (n+1) X (k+1) 0..5 arrays with every 2 X 2 subblock having its diagonal sum differing from its antidiagonal sum by 5, with no adjacent elements equal (constant-stress tilted 1 X 1 tilings).at n=27A235186