login
A393918
Triangle read by rows: T(n, k) is the number of compositions of n into parts at least k.
1
1, 2, 1, 4, 1, 1, 8, 2, 1, 1, 16, 3, 1, 1, 1, 32, 5, 2, 1, 1, 1, 64, 8, 3, 1, 1, 1, 1, 128, 13, 4, 2, 1, 1, 1, 1, 256, 21, 6, 3, 1, 1, 1, 1, 1, 512, 34, 9, 4, 2, 1, 1, 1, 1, 1, 1024, 55, 13, 5, 3, 1, 1, 1, 1, 1, 1, 2048, 89, 19, 7, 4, 2, 1, 1, 1, 1, 1, 1
OFFSET
1,2
FORMULA
G.f. for column k: (1-x)/(1-x-x^k).
T(n, k) = A099238(n-k, k-1).
T(n, k) = A141539(n-2*k+1, k-1) for k <= (n+1)/2.
EXAMPLE
T(6, 2) = 5 because the compositions of 6 into parts at least 2 are: 2+2+2, 2+4, 4+2, 3+3, 6.
Triangle begins:
1;
2, 1;
4, 1, 1;
8, 2, 1, 1;
16, 3, 1, 1, 1;
32, 5, 2, 1, 1, 1;
64, 8, 3, 1, 1, 1, 1;
...
PROG
(PARI) T(n, k) = {my(x='x+O('x^(n+1))); polcoef((1-x)/(1-x-x^k), n)}
KEYWORD
nonn,tabl
AUTHOR
Jason Yuen, May 10 2026
STATUS
approved