31106

Appears in sequences

• Glaisher's function V(n).at n=33A002611
• a(0) = 1, a(n) = 24*n^2 + 2 for n>0.at n=36A010014
• Triangle read by rows: T(n,k) is the number of k-matchings in the P_4 X P_n lattice graph.at n=40A100265
• Sequence of numerators associated with the continued fraction based on the sequence d(n)= distance of n from closest prime ( A051699).at n=26A110976
• Numbers n such that P(13*n) is prime, where P(n) is the unrestricted partition number.at n=22A113518
• Difference between successive primes cubed: a(n) = prime(n+1)^3 - prime(n)^3.at n=19A129701
• Number of unit cubes that have a side on the surface of a p X p X p cube composed of p^3 unit cubes, where p is the n-th prime.at n=20A261971
• Expansion of Sum_{i>=1} mu(i)^2*x^i/(1 - x^i) * Product_{j=1..i} 1/(1 - mu(j)^2*x^j), where mu() is the Moebius function (A008683).at n=46A284835
• Number of n X 3 0..1 arrays with every element equal to 0, 1, 2 or 3 horizontally, vertically or antidiagonally adjacent elements, with upper left element zero.at n=5A300467
• Number of nX6 0..1 arrays with every element equal to 0, 1, 2 or 3 horizontally, vertically or antidiagonally adjacent elements, with upper left element zero.at n=2A300470
• T(n,k)=Number of nXk 0..1 arrays with every element equal to 0, 1, 2 or 3 horizontally, vertically or antidiagonally adjacent elements, with upper left element zero.at n=30A300472
• T(n,k)=Number of nXk 0..1 arrays with every element equal to 0, 1, 2 or 3 horizontally, vertically or antidiagonally adjacent elements, with upper left element zero.at n=33A300472