OFFSET
1,11
COMMENTS
LINKS
W. Lang, First 18 rows.
FORMULA
T(n, m)= number of partitions of n with only odd parts and largest part is k:=2*m-1, m=1, 2, ..., ceiling(n/2).
EXAMPLE
[1]; [1]; [1,1]; [1,1]; [1,1,1]; [1,2,1]; [1,2,1,1]; [1,2,2,1]; ...
T(8,2)=2 because there are two partitions of 8 with odd parts from {1,3} and 3 appears at least once, namely (1^5,3) and (1^2,3^2).
T(6,2)=2 from 6= 3+3 = 1+1+1+3.
CROSSREFS
KEYWORD
nonn,tabf,easy
AUTHOR
Wolfdieter Lang, Aug 13 2004
STATUS
approved