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.

A035791 Start of a string of exactly 3 consecutive (but disjoint) pairs of twin primes.

This page as a plain text file.
%I A035791 #31 Jun 24 2022 04:38:39
%S A035791 5,179,809,3359,4217,6761,18041,21587,26861,49367,67187,80447,82721,
%T A035791 91127,97841,98897,103967,109829,122597,154157,178037,203321,208931,
%U A035791 225749,227609,236867,243671,251201,266447,285611,289109,295871,317729
%N A035791 Start of a string of exactly 3 consecutive (but disjoint) pairs of twin primes.
%D A035791 Posting to Number Theory List (NMBRTHRY(AT)LISTSERV.NODAK.EDU), Nov. 19 1998.
%H A035791 Sebastian Petzelberger, <a href="/A035791/b035791.txt">Table of n, a(n) for n = 1..10000</a>
%e A035791 a(2)=179 because (179,181),(191,193),(197,199) is the second occurrence (after (5,7),(11,13),(17,19)) of exactly 3 pairs of twin primes.
%t A035791 Select[Prime@ Range@ 30000, And[ NextPrime[#, -1] - NextPrime[#, -2] != 2, NextPrime@ # - # == 2, NextPrime[#, 3] - NextPrime[#, 2] == 2, NextPrime[#, 5] - NextPrime[#, 4] == 2, NextPrime[#, 7] - NextPrime[#, 6] > 2] &] (* _Michael De Vlieger_, Apr 25 2015 *)
%t A035791 Select[Partition[Prime[Range[30000]],10,1],#[[8]]-#[[7]]==#[[6]]-#[[5]] == #[[4]] - #[[3]]==2&&#[[2]]-#[[1]]!=2&&#[[10]]-#[[9]]!=2&][[All,3]] (* _Harvey P. Dale_, Mar 14 2018 *)
%Y A035791 Cf. A035789, A035790, A035792, A035793, A035794, A035795, A087641.
%K A035791 nonn,easy
%O A035791 1,1
%A A035791 _Randall L Rathbun_
%E A035791 More terms from _Hugo Pfoertner_, Sep 05 2003
%E A035791 Offset corrected by _Arkadiusz Wesolowski_, May 06 2012