The OEIS Foundation is supported by donations from users of the OEIS and by a grant from the Simons Foundation.

 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 A024936 a(n) = maximal length of partitions of n into distinct primes or -1 if there is no such partition. 6
 0, -1, 1, 1, -1, 2, -1, 2, 2, 2, 3, 1, 3, 2, 3, 3, 3, 4, 3, 3, 3, 4, 3, 4, 3, 4, 4, 4, 5, 4, 5, 4, 4, 4, 5, 4, 5, 4, 5, 5, 5, 6, 5, 5, 5, 6, 5, 6, 5, 6, 5, 6, 5, 6, 5, 6, 6, 6, 7, 6, 7, 6, 6, 6, 7, 6, 7, 6, 7, 6, 7, 6, 7, 6, 7, 7, 7, 8, 7, 7, 7, 8, 7, 8, 7, 7, 7, 8, 7, 8, 7, 8, 7, 8, 7, 8, 7, 8, 8, 8, 9, 8, 7, 8, 8, 8, 9, 8, 9, 8, 9, 8 (list; graph; refs; listen; history; text; internal format)
 OFFSET 0,6 LINKS Alois P. Heinz, Table of n, a(n) for n = 0..2000 EXAMPLE a(12) = 3 because 12 = 2+3+7, but 12 is not a sum of 4 or more distinct primes. CROSSREFS a(n) + 1 = row length of A219180(n). Sequence in context: A065531 A256558 A239281 * A144590 A057368 A192394 Adjacent sequences:  A024933 A024934 A024935 * A024937 A024938 A024939 KEYWORD sign AUTHOR EXTENSIONS More terms from Naohiro Nomoto, Oct 28 2001 More terms from David Wasserman, Jan 23 2003 Offset changed and edited by Alois P. Heinz, Nov 13 2012 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 May 5 19:31 EDT 2021. Contains 343573 sequences. (Running on oeis4.)