OFFSET
1,4
COMMENTS
For each row, k lies in the range 0..ceiling(n/2). The upper end of the range is the upper irredundance number of the graph.
LINKS
Andrew Howroyd, Table of n, a(n) for n = 1..990
Eric Weisstein's World of Mathematics, Maximal Irredundant Set
Eric Weisstein's World of Mathematics, Path Graph
FORMULA
T(n,k) = 0 for k < ceiling(n/3).
EXAMPLE
Triangle begins:
0, 1;
0, 2;
0, 1, 1;
0, 0, 4;
0, 0, 5, 1;
0, 0, 2, 6;
0, 0, 0, 12, 1;
0, 0, 0, 8, 9;
0, 0, 0, 1, 25, 1;
0, 0, 0, 0, 28, 12;
0, 0, 0, 0, 12, 44, 1;
0, 0, 0, 0, 2, 68, 16;
...
As polynomials these are: x; 2*x; x + x^2; 4*x^2; 5*x^2 + x^3; etc.
CROSSREFS
KEYWORD
nonn,tabf
AUTHOR
Andrew Howroyd, Aug 23 2017
STATUS
approved