login
This site is supported by donations to The OEIS Foundation.

 

Logo


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: A131840 A256558 A239281 * A144590 A057368 A192394

Adjacent sequences:  A024933 A024934 A024935 * A024937 A024938 A024939

KEYWORD

sign

AUTHOR

Clark Kimberling

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 | More pages
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy .

Last modified June 24 07:19 EDT 2017. Contains 288697 sequences.