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.

A090837 Primes p such that p, p+6, p+12, p+18 are consecutive primes and p = 6*k+1 for some k.

This page as a plain text file.
%I A090837 #16 Nov 11 2020 22:50:19
%S A090837 1741,3301,5101,6361,15901,18211,19471,30091,30631,53611,63691,71341,
%T A090837 77551,80911,83431,89101,91291,95911,105361,105601,108631,119551,
%U A090837 120811,130681,141061,144241,152941,172981,186871,206191,218131,228841,230221,252151,263071,280921,285451
%N A090837 Primes p such that p, p+6, p+12, p+18 are consecutive primes and p = 6*k+1 for some k.
%H A090837 Robert Israel, <a href="/A090837/b090837.txt">Table of n, a(n) for n = 1..2000</a>
%e A090837 1741, 1747, 1753, 1759 are consecutive primes, 1747 = 1741 + 6, 1753 = 1741 + 12, 1759 = 1741 + 18 and 1741 = 6 * 290 + 1.
%p A090837 filter:= p -> isprime(p) and nextprime(p) = p+6 and nextprime(p+6)=p+12 and nextprime(p+12)=p+18:
%p A090837 select(filter, [seq(i,i=1..10^6,6)]); # _Robert Israel_, Nov 11 2020
%o A090837 (PARI) isok(p) = my(q,r,s); isprime(p) && ((p % 6) == 1) && ((q=nextprime(p+1)) == p+6) && ((r=nextprime(q+1)) == p+12) && ((s=nextprime(r+1)) == p+18); \\ _Michel Marcus_, Sep 20 2019
%Y A090837 Cf. A033451, A090832, A090833, A090834, A090835, A090836, A090838, A090839.
%K A090837 easy,nonn
%O A090837 1,1
%A A090837 _Pierre CAMI_, Dec 09 2003
%E A090837 More terms from _Michel Marcus_, Sep 20 2019