cp's OEIS Frontend

This is a front-end for the Online Encyclopedia of Integer Sequences, made by Christian Perfect. The idea is to provide OEIS entries in non-ancient HTML, and then to think about how they're presented visually. The source code is on GitHub.

A087127 This table shows the coefficients of combinatorial formulas needed for generating the sequential sums of p-th powers of triangular numbers. The p-th row (p>=1) contains a(i,p) for i=1 to 2*p-1, where a(i,p) satisfies Sum_{i=1..n} C(i+1,2)^p = 3 * C(n+2,3) * Sum_{i=1..2*p-1} a(i,p) * C(n-1,i-1)/(i+2).

Table of values

n a(n)
1 1
2 1
3 2
4 1
5 1
6 8
7 19
8 18
9 6
10 1
11 26
12 163
13 432
14 564
15 360
16 90
17 1
18 80
19 1135
20 6354
21 18078
22 28800
23 26100
24 12600
25 2520
26 1
27 242
28 7291
29 77400
30 405060
31 1210680
32 2211570
33 2520000
34 1751400
35 680400
36 113400
37 1
38 728
39 45199
40 862218
41 7667646
42 38350080
43 118848420

List of values

[1, 1, 2, 1, 1, 8, 19, 18, 6, 1, 26, 163, 432, 564, 360, 90, 1, 80, 1135, 6354, 18078, 28800, 26100, 12600, 2520, 1, 242, 7291, 77400, 405060, 1210680, 2211570, 2520000, 1751400, 680400, 113400, 1, 728, 45199, 862218, 7667646, 38350080, 118848420]

Started in 1964 by Neil J. A. Sloane | Maintained by The OEIS Foundation Inc.

Content is available under The OEIS End-User License Agreement.