This site is supported by donations to The OEIS Foundation. Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 A057601 a(0) = a(1) = 1; a(n+1) = number of partitions of n into a(k)'s, 0 <= k <= n, each k occurring at most once. 1
 1, 1, 2, 2, 4, 4, 6, 8, 10, 11, 12, 14, 17, 21, 25, 29, 33, 37, 43, 49, 54, 59, 66, 72, 80, 89, 98, 106, 116, 126, 137, 148, 161, 174, 187, 200, 216, 232, 248, 266, 284, 302, 321, 344, 367, 391, 414, 440, 465, 493, 523, 556, 584, 616, 650, 689, 726, 768, 808 (list; graph; refs; listen; history; text; internal format)
 OFFSET 0,3 LINKS Alois P. Heinz, Table of n, a(n) for n = 0..1000 EXAMPLE a(6) = 6 because 5 = a(0) + a(4) = a(0) + a(5) = a(1) + a(4) = a(1) + a(5) = a(0) + a(2) + a(3) = a(1) + a(2) + a(3). MAPLE b:= proc(n, i) option remember; `if`(n=0, 1, `if`(i<0, 0,        b(n, i-1)+`if`(a(i)>n, 0, b(n-a(i), i-1))))     end: a:= proc(n) a(n):= `if`(n<2, 1, b(n-1, n-1)) end: seq(a(n), n=0..70);  # Alois P. Heinz, May 26 2013 CROSSREFS Sequence in context: A218064 A183002 A211859 * A294150 A087135 A227135 Adjacent sequences:  A057598 A057599 A057600 * A057602 A057603 A057604 KEYWORD nonn AUTHOR Leroy Quet, Oct 06 2000 EXTENSIONS More terms from Naohiro Nomoto, Oct 28 2001 Extended beyond a(45) by Alois P. Heinz, May 26 2013 STATUS approved

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recent
The OEIS Community | Maintained by The OEIS Foundation Inc.

Last modified March 23 13:17 EDT 2019. Contains 321430 sequences. (Running on oeis4.)