127050

Appears in sequences

• 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=16A087110
• Triangle read by rows: T(n,h)/(n-1), where T is the array in A101819.at n=30A101820
• a(n) = lcm_{k=0..n} (k! + 1).at n=5A137244
• Numbers with exactly 5 distinct prime divisors {2,3,5,7,11}.at n=36A147572
• Positive numbers m such that m^2 - 1 divides 4^m - 1.at n=36A271842
• 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=44A290310
• Wiener index of the n X n rook complement graph.at n=21A292058
• a(n) = Sum_{1 <= x_1, x_2 <= n} sigma( n/gcd(x_1, x_2, n) ).at n=41A373129