39711

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=31A000447
• Binomial coefficient C(7n,n-6).at n=3A004374
• Dodecahedral numbers: a(n) = n*(3*n - 1)*(3*n - 2)/2.at n=21A006566
• Odd tetrahedral numbers: a(n) = (4*n+1)*(4*n+2)*(4*n+3)/6.at n=15A015219
• Binomial coefficients C(n,60).at n=3A017724
• Binomial coefficients C(63,n).at n=3A017779
• (prime(n)-5)(prime(n)-7)(prime(n)-9)/48.at n=29A030002
• a(n) = (prime(n) - 1)*(prime(n) - 3)*(prime(n) - 5)/48.at n=29A030004
• Squarefree tetrahedral numbers.at n=19A070755
• G.f. satisfies: A(x) = x + 2*x*A(x) + x*A(A(x)).at n=6A120575
• Tetrahedral numbers k*(k+1)*(k+2)/6 such that exactly one of k, k+1, and k+2 is prime.at n=35A144521
• Sequence related to Hankel transform of super-ballot numbers.at n=29A156126
• Triangle t(n,m) read by rows: t(n,m) = binomial(2^n-1, 2^m-1) if n >= 2*m, otherwise symmetrically extended t(n,m) = t(n,n-m).at n=23A176791
• Triangle t(n,m) read by rows: t(n,m) = binomial(2^n-1, 2^m-1) if n >= 2*m, otherwise symmetrically extended t(n,m) = t(n,n-m).at n=25A176791
• a(n) = binomial(n*Omega(n),Omega(n)) / n.at n=15A178034
• Irregular array T(n,k) of the numbers of non-extendable (complete) non-self-adjacent simple paths ending at each of a minimal subset of nodes within a square lattice bounded by rectangles with nodal dimensions n and 8, n >= 2.at n=38A214375
• Greedy-summable tetrahedral numbers.at n=35A242291
• Number of nX4 0..1 arrays with every element unequal to 1, 2, 3 or 4 king-move adjacent elements, with upper left element zero.at n=5A303892
• Number of n X 6 0..1 arrays with every element unequal to 1, 2, 3 or 4 king-move adjacent elements, with upper left element zero.at n=3A303894
• T(n,k)=Number of nXk 0..1 arrays with every element unequal to 1, 2, 3 or 4 king-move adjacent elements, with upper left element zero.at n=39A303896