OFFSET
0,4
COMMENTS
Number of ways of writing n as a sum [p(1,1) + p(1,2) + ... + p(1,k)] + [p(2,1) + ... + p(2,k-1)] + [p(3,1) + ... + p(3,k-2)] + ... + [p(k,1)] for some k =0, 1, 2, ..., so that in the triangular array {p(i,j)} the numbers are nonincreasing along rows and columns. All the p(i,j) are >= 1.
LINKS
Jon E. Schoenfield, Table of n, a(n) for n = 0..64
EXAMPLE
a(8)=12, as seen from the following list:
8...61..51..41..52..42..32..43..33..311.211.221
....1...2...3...1...2...3...1...2...11..21..11.
....................................1...1...1..
CROSSREFS
KEYWORD
nonn,nice
AUTHOR
John W. Layman, Jan 02 2004
EXTENSIONS
More terms from Jon E. Schoenfield, Aug 06 2006
STATUS
approved