cp's OEIS Frontend

This is a front-end for the Online Encyclopedia of Integer Sequences, made by Christian Perfect. The idea is to provide OEIS entries in non-ancient HTML, and then to think about how they're presented visually. The source code is on GitHub.

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.

This page as a plain text file.
%I A256812 #8 Apr 14 2015 10:29:41
%S A256812 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,
%T A256812 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,
%U A256812 0,5,0,20,0,20,41,0,0,0,5,0,0,0,41,0,13,20
%N 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.
%C A256812 Using similar arguments as in comment in A256547, we obtain that every term is 0,2,5,6,13,20,41.
%H A256812 Peter J. C. Moses, <a href="/A256812/b256812.txt">Table of n, a(n) for n = 1..1000</a>
%Y A256812 Cf. A001014, A089306, A256385, A256503, A256546, A256547, A256581.
%K A256812 nonn
%O A256812 1,2
%A A256812 _Vladimir Shevelev_ and _Peter J. C. Moses_, Apr 10 2015