login
A137596
Triangle read by rows: T(n, k) = Sum_{i=0..n) Stirling2(i, k).
1
1, 1, 1, 1, 2, 1, 1, 3, 4, 1, 1, 4, 11, 7, 1, 1, 5, 26, 32, 11, 1, 1, 6, 57, 122, 76, 16, 1, 1, 7, 120, 423, 426, 156, 22, 1, 1, 8, 247, 1389, 2127, 1206, 288, 29, 1, 1, 9, 502, 4414, 9897, 8157, 2934, 491, 37, 1
OFFSET
0,5
FORMULA
T = A000012 * A048993 as infinite lower triangular matrices.
T(n, k) = Sum_{i=0..n-k} Stirling2(i+k, k). - Igor Victorovich Statsenko, May 25 2024
EXAMPLE
First few rows of the triangle:
1;
1, 1;
1, 2, 1;
1, 3, 4, 1;
1, 4, 11, 7, 1;
1, 5, 26, 32, 11, 1;
1, 6, 57, 122, 76, 16, 1;
1, 7, 120, 423, 426, 156, 22, 1;
...
MAPLE
T := (n, k) -> add(Stirling2(i, k), i=0..n):
seq(seq(T(n, k), k=0..n), n=0..9); # Peter Luschny, Mar 07 2025
CROSSREFS
Cf. A005001 (row sums), A048993.
Sequence in context: A340814 A063841 A256161 * A111669 A336573 A124834
KEYWORD
nonn,tabl,changed
AUTHOR
Gary W. Adamson, Jan 29 2008
EXTENSIONS
Offset set to 0 by Peter Luschny, May 25 2024
STATUS
approved