2772000

Appears in sequences

• This table shows the coefficients of combinatorial formulas needed for generating the sequential sums of p-th powers of tetrahedral numbers. The p-th row (p>=1) contains a(i,p) for i=1 to 3*p-2, where a(i,p) satisfies Sum_{i=1..n} C(i+2,3)^p = 4 * C(n+3,4) * Sum_{i=1..3*p-2} a(i,p) * C(n-1,i-1)/(i+3).at n=33A087107
• Number of permutations of 1..n with the sequence of sums of 4 adjacent elements having exactly 1 maximum.at n=8A179720
• Number of permutations of 1..n with the sequence of sums of 4 adjacent elements having exactly 4 maxima.at n=2A179723
• a(n) = Product_{d|n, d<n} A019565(A193231(d)).at n=43A293231
• Integers m such that the number of divisors whose last digit equals the last digit of m sets a new record.at n=32A342833
• a(n) is the smallest number k with exactly n of its divisors in A037197.at n=31A362139
• Triangle read by rows, T(n, k) = binomial(n, k) * k! * Stirling2(n-k, k), for n >= 0 and 0 <= k <= n//2, where '//' denotes integer division.at n=40A362369
• Table read by rows: T(n, k) = A124320(n + 1, k) * A048993(n, k).at n=32A368584