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.

A090832 Numbers k such that p(k), p(k)+6, p(k)+12, p(k)+18 are consecutive primes, where p(k) denotes k-th prime.

This page as a plain text file.
%I A090832 #14 Aug 09 2025 19:34:23
%S A090832 54,271,464,682,709,821,829,1510,1594,1726,1842,1853,2009,2086,2209,
%T A090832 2600,2876,3253,3303,5463,5689,6252,6386,7064,7438,7620,7728,7918,
%U A090832 8090,8145,8229,8631,8654,8828,9105,9184,9243,9997,10052,10074,10329,10934,11257,11343
%N A090832 Numbers k such that p(k), p(k)+6, p(k)+12, p(k)+18 are consecutive primes, where p(k) denotes k-th prime.
%H A090832 Zak Seidov, <a href="/A090832/b090832.txt">Table of n, a(n) for n = 1..1581</a>
%e A090832 p(271)=1741: 1741,1747,1753,1759 are consecutive primes,1747=1741+6,1753=1741+12,1759=1741+18
%t A090832 p[n_]:=Prime[n];Select[Range[15000],p[ #+1]-p[ # ]==p[ #+2]-p[ #+1]==p[ #+3]-p[ #+2]==6&] (* _Zak Seidov_, Mar 05 2006 *)
%t A090832 PrimePi[#[[1]]]&/@Select[Partition[Prime[Range[11000]],4,1],Differences[#]=={6,6,6}&] (* _Harvey P. Dale_, Oct 28 2023 *)
%Y A090832 Cf. A033451, A090833, A090834, A090835, A090836, A090837, A090838, A090839.
%K A090832 easy,nonn
%O A090832 1,1
%A A090832 _Pierre CAMI_, Dec 09 2003
%E A090832 Corrected and extended by _Zak Seidov_, Mar 05 2006