login
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

%I #9 Oct 30 2018 10:31:02

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

%T 17,15,20,25,18,19,18,14,21,21,27,22,19,22,22,28,31,29,25,22,27,35,43,

%U 35,34,27,42,40,46,45,53,36,33,48,46,53,34,39,57,53,50,47,39,63,66,60

%N 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.

%H Zak Seidov, <a href="/A102706/b102706.txt">Table of n, a(n) for n = 0..1000</a>

%e a(2)=1 since 2^3 = 8 = 3+5;

%e a(6)=2 since 6^3 = 216 = 5+7+11+13+17+163 = 7+11+13+17+19+149;

%e a(8)=0 since no such partition exists for 8^3.

%Y Cf. A102352.

%K nonn

%O 0,7

%A _Giovanni Teofilatto_, Feb 05 2005

%E Corrected and extended by _Ray Chandler_ Feb 25 2005