login
a(n) = maximal length of partitions of n into distinct primes or -1 if there is no such partition.
6

%I #10 Nov 13 2012 19:03:14

%S 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,

%T 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,

%U 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

%N a(n) = maximal length of partitions of n into distinct primes or -1 if there is no such partition.

%H Alois P. Heinz, <a href="/A024936/b024936.txt">Table of n, a(n) for n = 0..2000</a>

%e a(12) = 3 because 12 = 2+3+7, but 12 is not a sum of 4 or more distinct primes.

%Y a(n) + 1 = row length of A219180(n).

%K sign

%O 0,6

%A _Clark Kimberling_

%E More terms from _Naohiro Nomoto_, Oct 28 2001

%E More terms from _David Wasserman_, Jan 23 2003

%E Offset changed and edited by _Alois P. Heinz_, Nov 13 2012