A137855 Triangle read by rows: T(n,k) = Sum_{j=1..n-k+1} Stirling2(k, j).
1, 1, 1, 1, 2, 1, 1, 2, 4, 1, 1, 2, 5, 8, 1, 1, 2, 5, 14, 16, 1, 1, 2, 5, 15, 41, 32, 1, 1, 2, 5, 15, 51, 122, 64, 1, 1, 2, 5, 15, 52, 187, 365, 128, 1, 1, 2, 5, 15, 52, 202, 715, 1094, 256, 1, 1, 2, 5, 15, 52, 203, 855, 2795, 3281, 512, 1
Offset: 1
Examples
First few rows of the array: 1, 1, 1, 1, 1, ... 1, 2, 4, 8, 16, ... 1, 2, 5, 14, 41, ... 1, 2, 5, 14, 51, ... 1, 2, 5, 14, 52, ... ... First few rows of the triangle: 1; 1, 1; 1, 2, 1; 1, 2, 4, 1; 1, 2, 5, 8, 1; 1, 2, 5, 14, 16, 1; 1, 2, 5, 15, 41, 32, 1; 1, 2, 5, 15, 51, 122, 64, 1; 1, 2, 5, 15, 52, 187, 365, 128, 1; 1, 2, 5, 15, 52, 202, 715, 1094, 256, 1; ...
Links
- Andrew Howroyd, Table of n, a(n) for n = 1..1275
Programs
-
PARI
T(n,k)={sum(j=1, n-k+1, stirling(k,j,2))} \\ Andrew Howroyd, Aug 09 2018
Formula
Extensions
Name changed by Andrew Howroyd, Aug 09 2018
Comments