A104121 a(n)=1 if there is a partition 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, otherwise a(0)=0 if no such partition exists.

0, 0, 1, 1, 1, 1, 1, 1, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1

Offset

0,1

Links

Table of n, a(n) for n=0..95.

Example

a(2)=1 since 2^3 = 8 = 3+5;
a(8)=0 since no such partition exists for 8^3.

Crossrefs

Cf. A102352, A102706.

Sequence in context: A295306 A295303 A288226 * A179770 A189078 A257834

Adjacent sequences: A104118 A104119 A104120 * A104122 A104123 A104124

Keyword

easy,nonn

Author

Giovanni Teofilatto, Mar 06 2005

Status

approved