56070

Appears in sequences

• Alkane (or paraffin) numbers l(7,n).at n=38A005994
• Sum along upward diagonal of Pascal triangle up to (but not including) center.at n=24A010753
• T(2n+1,n+4), T given by A026780.at n=6A026901
• T(n,n-5), array T as in A038730.at n=7A038734
• Composite numbers k such that the difference between the odd and even aliquot parts of k divides k.at n=30A066193
• a(n) = n*(n+1)*(2*n^2+1)/6.at n=20A071238
• Triangle read by rows: T(n,k), n >=1, 0 <= k <= C(n,k), = number of n X n symmetric positive semi-definite matrices with 2's on the main diagonal and 1's and 0's elsewhere and with k 1's above the diagonal.at n=54A083029
• Triangle read by rows, X^n * [1,0,0,0,...]; where X = a tridiagonal matrix with (1,1,1,...) in the main and subdiagonals and (1,2,3,...) in the subsubdiagonal.at n=59A140733
• Numbers n with property that n^2 is a sum of some 120 successive primes.at n=30A166262
• Triangle T(n,k) represents the coefficients of (x^18*d/dx)^n, where n=1,2,3,....at n=25A223520
• a(n) = n*(n + 1)*(17*n - 14)/6.at n=27A237617
• a(n) is the smallest number which can be represented as the sum of n distinct positive cubes in exactly n ways, or 0 if no such number exists.at n=17A350270
• O.g.f. A(x) satisfies: A(x) = 1 + x*Sum_{n>=0} 2^n * log( A(3^n*x) )^n / n!.at n=4A366226
• Primitive terms of A023197 that are of the form 4u+2.at n=37A388020