OFFSET
0,4
COMMENTS
The rows are of lengths 1, 3, 5, 7, ...
In particular, the rows are 1; 1,1,2; 1,1,5,6,6; 1,1,5,13,26,30,20; ... etc.
Call the first row row 0 and entries starting from 0. Then entries i=0 through k in row k are A046717(i).
REFERENCES
J. Propp, Enumeration of matchings: problems and progress, pp. 255-291 in L. J. Billera et al., eds, New Perspectives in Algebraic Combinatorics, Cambridge, 1999 (see Problem 13).
LINKS
J. Propp, Publications and Preprints
J. Propp, Enumeration of matchings: problems and progress, in L. J. Billera et al. (eds.), New Perspectives in Algebraic Combinatorics
CROSSREFS
KEYWORD
hard,nonn,tabf
AUTHOR
Christopher Hanusa (chanusa(AT)math.washington.edu), Mar 24 2004
STATUS
approved