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.

A054691 New records in A054690 (start of n consecutive non-twin primes).

This page as a plain text file.
%I A054691 #26 May 19 2024 02:12:13
%S A054691 7,19,43,73,349,661,8629,13399,14629,24421,62299,187909,688453,850351,
%T A054691 17382481,30752233,32822371,136283431,248641039,255949951,390817729,
%U A054691 698542489,1256735191,1535220499,1899797989,2466641071,4289385523,24215097499,42441715489,43725662623
%N A054691 New records in A054690 (start of n consecutive non-twin primes).
%C A054691 Has many terms in common with A036061, but neither of the two is a subsequence of the other one. - _M. F. Hasler_, May 07 2022
%H A054691 Amiram Eldar, <a href="/A054691/b054691.txt">Table of n, a(n) for n = 1..41</a>
%o A054691 (Python)
%o A054691 from sympy import nextprime
%o A054691 from itertools import count, islice
%o A054691 def agen(): # generator of terms
%o A054691     p, q, n, rl, argp = 2, 3, 1, 0, 2
%o A054691     for k in count(1):
%o A054691         if q - p >= 4: rl += 1
%o A054691         else:
%o A054691             if rl >= n: yield argp; n = rl + 1
%o A054691             rl, argp = 0, q
%o A054691         p, q = q, nextprime(q)
%o A054691 print(list(islice(agen(), 14))) # _Michael S. Branicky_, Aug 23 2022
%Y A054691 Cf. A054690, A054692, A242459.
%Y A054691 Cf. A036061.
%K A054691 nonn
%O A054691 1,1
%A A054691 _Jeff Burch_, Apr 19 2000
%E A054691 a(10)-a(25) from _Sean A. Irvine_, Feb 17 2022
%E A054691 Offset changed and a(26)-a(29) from _Michael S. Branicky_, Aug 23 2022