A256812 Smallest k>=1 such that n^6 + (n+1)^6 + ... + (n+k)^6 is prime or a(n)=0 if there is no such k.

0, 2, 0, 2, 0, 0, 0, 0, 5, 0, 0, 6, 20, 0, 0, 5, 20, 0, 20, 0, 5, 13, 5, 5, 0, 0, 0, 0, 5, 0, 0, 0, 0, 2, 0, 0, 0, 0, 0, 0, 0, 6, 20, 0, 41, 2, 0, 5, 13, 0, 0, 0, 0, 6, 0, 0, 0, 5, 0, 0, 0, 0, 0, 0, 0, 0, 5, 0, 20, 0, 20, 41, 0, 0, 0, 5, 0, 0, 0, 41, 0, 13, 20

Offset: 1

Author

Vladimir Shevelev and Peter J. C. Moses, Apr 10 2015

Keywords

• nonn

Comments

Using similar arguments as in comment in A256547, we obtain that every term is 0,2,5,6,13,20,41.

Links

• Peter J. C. Moses, Table of n, a(n) for n = 1..1000

Crossrefs

Cf. A001014, A089306, A256385, A256503, A256546, A256547, A256581.