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.

A077038 Least difference of primes p, q such that p < n^3 < q.

This page as a plain text file.
%I A077038 #15 May 17 2016 12:05:28
%S A077038 4,6,6,14,12,10,12,6,12,34,10,24,8,16,6,10,12,6,16,20,12,34,22,10,6,6,
%T A077038 18,12,18,14,22,18,12,36,14,20,8,52,10,10,16,38,34,6,40,24,10,16,12,
%U A077038 14,8,18,20,30,20,32,18,34,40,48,10,6,8,18,10,18,18,30,30,30,42,20,6,44
%N A077038 Least difference of primes p, q such that p < n^3 < q.
%C A077038 Least m such that a(m)=2*n for n=1,2,3,... are: {2,3,14,7,6,5,15,28,21,24,13,...}. - _Zak Seidov_, May 10 2016
%C A077038 There are numbers k other than 2 such that a(k) = 4. The first few (up to 1000) are 129 189 369 435 549 555 561 819. Conjecture: every even integer greater than 2 occurs infinitely often in this sequence. - _Franklin T. Adams-Watters_, May 13 2016
%H A077038 Zak Seidov, <a href="/A077038/b077038.txt">Table of n, a(n) for n = 2..10000</a>
%F A077038 a(n) = A014220(n) - A077037(n).
%t A077038 Table[c=n^3;NextPrime[c]-NextPrime[c,-1],{n,2,80}] (* _Harvey P. Dale_, Sep 14 2012 *)
%Y A077038 Cf. A058043, A000578.
%K A077038 nonn
%O A077038 2,1
%A A077038 _Reinhard Zumkeller_, Oct 21 2002