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.

A089009 Numbers n such that 2*p(n)+3, 2*p(n+1)+3, 2*p(n+2)+3, 2*p(n+3)+3 are consecutive primes, where p(i) denotes the i-th prime.

This page as a plain text file.
%I A089009 #14 Aug 15 2020 20:22:09
%S A089009 62178,159794,308508,336390,350046,376777,395837,492449,611190,627072,
%T A089009 643266,643267,830501,887720,922151,961608,1009939,1011676,1174998,
%U A089009 1487107,1492042,1725364,1754501,1780962,1815913,2048082,2235662
%N A089009 Numbers n such that 2*p(n)+3, 2*p(n+1)+3, 2*p(n+2)+3, 2*p(n+3)+3 are consecutive primes, where p(i) denotes the i-th prime.
%H A089009 Pierre CAMI, <a href="/A089009/b089009.txt">Table of n, a(n) for n = 1..135</a>
%e A089009 p(62178)=776117, 2*776117+3=1552237=p(117814).
%e A089009 p(62179)=776119, 2*776119+3=1552241=p(117815).
%e A089009 p(62180)=776137, 2*776137+3=1552277=p(117816).
%e A089009 p(62181)=776143, 2*776143+3=1552289=p(117817).
%t A089009 cpQ[n_]:=Module[{p1=2Prime[n]+3,p2=2Prime[n+1]+3,p3=2Prime[n+2]+3,p4 = 2Prime[ n+3]+3}, PrimeQ[ p1] &&NextPrime[p1]==p2&&NextPrime[p2]==p3 && NextPrime[p3]==p4]; Select[Range[2236000],cpQ] (* _Harvey P. Dale_, Aug 15 2020 *)
%Y A089009 Subsequence of A088066.
%Y A089009 Cf. A089007, A089492, A089524.
%K A089009 nonn
%O A089009 1,1
%A A089009 _Pierre CAMI_, Nov 03 2003
%E A089009 Corrected and extended by _Ray Chandler_, Nov 04 2003