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.

A328362 Triangle read by rows: T(n,k) is the sum of all parts k in all partitions of n into consecutive parts, (1 <= k <= n).

Original entry on oeis.org

1, 0, 2, 1, 2, 3, 0, 0, 0, 4, 0, 2, 3, 0, 5, 1, 2, 3, 0, 0, 6, 0, 0, 3, 4, 0, 0, 7, 0, 0, 0, 0, 0, 0, 0, 8, 0, 2, 3, 8, 5, 0, 0, 0, 9, 1, 2, 3, 4, 0, 0, 0, 0, 0, 10, 0, 0, 0, 0, 5, 6, 0, 0, 0, 0, 11, 0, 0, 3, 4, 5, 0, 0, 0, 0, 0, 0, 12, 0, 0, 0, 0, 0, 6, 7, 0, 0, 0, 0, 0, 13, 0, 2, 3, 4, 5, 0, 0, 0, 0, 0, 0, 0, 0, 14
Offset: 1

Views

Author

Omar E. Pol, Oct 20 2019

Keywords

Comments

Iff n is a power of 2 (A000079) then row n lists n - 1 zeros together with n.
Iff n is an odd prime (A065091) then row n lists (n - 3)/2 zeros, (n - 1)/2, (n + 1)/2, (n - 3)/2 zeros, n.

Examples

			Triangle begins:
1;
0, 2;
1, 2, 3;
0, 0, 0, 4;
0, 2, 3, 0, 5;
1, 2, 3, 0, 0, 6;
0, 0, 3, 4, 0, 0, 7;
0, 0, 0, 0, 0, 0, 0, 8;
0, 2, 3, 8, 5, 0, 0, 0, 9;
1, 2, 3, 4, 0, 0, 0, 0, 0, 10;
0, 0, 0, 0, 5, 6, 0, 0, 0,  0, 11;
0, 0, 3, 4, 5, 0, 0, 0, 0,  0,  0, 12;
0, 0, 0, 0, 0, 6, 7, 0, 0,  0,  0,  0, 13;
0, 2, 3, 4, 5, 0, 0, 0, 0,  0,  0,  0,  0, 14;
1, 2, 3, 8,10, 6, 7, 8, 0,  0,  0,  0,  0,  0, 15;
0, 0, 0, 0, 0, 0, 0, 0, 0,  0,  0,  0,  0,  0,  0, 16;
...
For n = 9 there are three partitions of 9 into consecutive parts, they are [9], [5, 4], [4, 3, 2], so the 9th row of triangle is [0, 2, 3, 8, 5, 0, 0, 0, 9].
		

Crossrefs

Row sums give A245579.
Column 1 gives A010054, n => 1.
Leading diagonal gives A000027.

Formula

T(n,k) = k*A328361(n,k).