47905

Appears in sequences

• a(n) = 1^2 + 3^2 + 5^2 + 7^2 + ... + (2*n-1)^2 = n*(4*n^2 - 1)/3.at n=33A000447
• Odd tetrahedral numbers: a(n) = (4*n+1)*(4*n+2)*(4*n+3)/6.at n=16A015219
• Binomial coefficients C(n,64).at n=3A017728
• Binomial coefficients C(67,n).at n=3A017783
• (prime(n)-5)(prime(n)-7)(prime(n)-9)/48.at n=31A030002
• a(n) = (prime(n)-3)*(prime(n)-5)*(prime(n)-7)/48.at n=31A030003
• Number of 5 X 5 pandiagonal magic squares with sum n.at n=9A070212
• Squarefree tetrahedral numbers.at n=20A070755
• Number of terms of A109858 with digit sum n.at n=18A109859
• Triangle, read by rows, where T(n,k) = C( C(n+2,3) - C(k+2,3) + 3, n-k) for n>=k>=0.at n=32A126457
• a(n) = binomial(prime(n+2), 3).at n=17A126995
• Tetrahedral numbers k*(k+1)*(k+2)/6 such that exactly one of k, k+1, and k+2 is prime.at n=36A144521
• Square array A(n,k), n>=0, k>=0, read by antidiagonals: A(n,k) is the number of partitions of 2^n into powers of 2 less than or equal to 2^k.at n=74A152977
• Sequence related to Hankel transform of super-ballot numbers.at n=31A156126
• Square array A(n,k), n>=0, k>=0, read by antidiagonals: A(n,k) is the number of partitions of 2^2^n into powers of 2 less than or equal to 2^k.at n=24A172288
• Number of partitions of 2^2^n into powers of 2 less than or equal to 2^n.at n=3A182135
• Primitive n such that k^k == k+1 (mod n) has no nonzero solutions.at n=11A191835
• Number of 0..n arrays x(0..5) of 6 elements with zero 4th differences.at n=31A200084
• Number of partitions of 2^n into powers of 2 less than or equal to 8.at n=8A210772
• a(n) = binomial(3*n + 1,3).at n=21A228887