33642

Appears in sequences

• a(0) = 1, a(n) = 40*n^2 + 2 for n>0.at n=29A010022
• Ratio from A049102.at n=53A049106
• Total number of parts in all partitions of n into odd parts.at n=47A067588
• This table shows the coefficients of combinatorial formulas needed for generating the sequential sums of p-th powers of binomial coefficients C(n,6). The p-th row (p>=1) contains a(i,p) for i=1 to 6*p-5, where a(i,p) satisfies Sum_{i=1..n} C(i+5,6)^p = 7 * C(n+6,7) * Sum_{i=1..6*p-5} a(i,p) * C(n-1,i-1)/(i+6).at n=18A087110
• Numbers k such that there are 10 digits in k^2 and for each factor f of 10 (1, 2, 5) the sum of digit groupings of size f is a square.at n=12A153748
• The A161671(n)-th partial sum of A161671.at n=42A161778
• The A161671(n)-th partial sum of A161671.at n=43A161778
• Dispersion of (2*floor(n*sqrt(3))), by antidiagonals.at n=45A191542
• Total number of inversions in all partitions of n.at n=24A271370
• Irregular triangle read by rows. Row n gives the coefficients of the polynomial multiplying the exponential function in the e.g.f. of the (n+1)-th diagonal sequences of triangle A008459 (Pascal squares). T(n,k) for n >= 0 and k = 0..2*n.at n=46A290310