login

Year-end appeal: Please make a donation to the OEIS Foundation to support ongoing development and maintenance of the OEIS. We are now in our 61st year, we have over 378,000 sequences, and we’ve reached 11,000 citations (which often say “discovered thanks to the OEIS”).

A102706
Number of partitions of n^3 into n primes such that n-1 are consecutive primes and the remaining prime is larger than the sum of the n-1 consecutive primes.
3
0, 0, 1, 1, 1, 1, 2, 2, 0, 2, 3, 6, 3, 2, 2, 5, 7, 10, 8, 9, 5, 5, 9, 15, 10, 8, 4, 5, 15, 27, 15, 17, 15, 20, 25, 18, 19, 18, 14, 21, 21, 27, 22, 19, 22, 22, 28, 31, 29, 25, 22, 27, 35, 43, 35, 34, 27, 42, 40, 46, 45, 53, 36, 33, 48, 46, 53, 34, 39, 57, 53, 50, 47, 39, 63, 66, 60
OFFSET
0,7
EXAMPLE
a(2)=1 since 2^3 = 8 = 3+5;
a(6)=2 since 6^3 = 216 = 5+7+11+13+17+163 = 7+11+13+17+19+149;
a(8)=0 since no such partition exists for 8^3.
CROSSREFS
Cf. A102352.
Sequence in context: A362991 A215976 A141058 * A105673 A259761 A350272
KEYWORD
nonn
AUTHOR
Giovanni Teofilatto, Feb 05 2005
EXTENSIONS
Corrected and extended by Ray Chandler Feb 25 2005
STATUS
approved