OFFSET
1,2
COMMENTS
Equivalently, Sum_{k=2}^n (Number of partitions of n into powers of k) + Number of partitions of n into n 1's; the latter term is C(2n-1,n).
LINKS
Alois P. Heinz, Table of n, a(n) for n = 1..500
EXAMPLE
a(2) = 5; 3 partitions for k=1: 2.1^0, 1.1^1+1.1^0, 2.1^1; and 2 for k=2: 2.2^0, 1.2^1
CROSSREFS
KEYWORD
easy,nonn
AUTHOR
Marc LeBrun, Jan 08 2005
EXTENSIONS
Edited and verified by Franklin T. Adams-Watters, Mar 10, 2006
STATUS
approved