This site is supported by donations to The OEIS Foundation.

 Annual appeal: Please make a donation to keep the OEIS running! Over 6000 articles have referenced us, often saying "we discovered this result with the help of the OEIS". Other ways to donate

 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 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 (list; graph; refs; listen; history; text; internal format)
 OFFSET 0,7 LINKS Moshe Levin, Table of n, a(n) for n = 0..1000 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: A165316 A215976 A141058 * A105673 A259761 A171933 Adjacent sequences:  A102703 A102704 A102705 * A102707 A102708 A102709 KEYWORD nonn AUTHOR Giovanni Teofilatto, Feb 05 2005 EXTENSIONS Corrected and extended by Ray Chandler Feb 25 2005 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.

Last modified November 19 08:51 EST 2017. Contains 294923 sequences.