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.
%I A320709 #12 Sep 08 2022 08:46:23
%S A320709 189,297,344,375,457,487,522,549,557,721,836,914,1010,1158,1170,1197,
%T A320709 1233,1242,1272,1290,1370,1390,1444,1471,1625,1633,1672,1683,1757,
%U A320709 1858,1975,1983,2039,2074,2158,2243,2248,2250,2327,2370,2388,2614,2638,2703,2725,2838,2842,2872
%N A320709 Indices of primes followed by a gap (distance to next larger prime) of 22.
%C A320709 Indices of the primes listed in A061779.
%H A320709 Vincenzo Librandi, <a href="/A320709/b320709.txt">Table of n, a(n) for n = 1..10040</a>
%H A320709 <a href="/index/Pri#gaps">Index entries for primes, gaps between</a>.
%F A320709 a(n) = A000720(A061779(n)).
%F A320709 A320709 = { i > 0 | prime(i+1) = prime(i) + 22 }.
%t A320709 Select[Range[3000], Prime[#] + 22 == Prime[# + 1] &] (* _Vincenzo Librandi_, Mar 22 2019 *)
%o A320709 (PARI) A(N=100,g=22,p=2,i=primepi(p)-1,L=List())={forprime(q=1+p,,i++; if(p+g==p=q, listput(L,i); N--||break));Vec(L)} \\ returns the list of first N terms of the sequence
%o A320709 (Magma) [n: n in [1..3000] | NthPrime(n+1) - NthPrime(n) eq 22]; // _Vincenzo Librandi_, Mar 22 2019
%Y A320709 Equals A000720 o A061779.
%Y A320709 Row 11 of A174349.
%Y A320709 Indices of 22's in A001223.
%Y A320709 Cf. A029707, A029709, A320701, A320702, ..., A320720 (analog for gaps 2, 4, 6, 8, ..., 44), A116493 (gap 70), A116496 (gap 100), A116497 (gap 200), A116495 (gap 210).
%K A320709 nonn
%O A320709 1,1
%A A320709 _M. F. Hasler_, Oct 19 2018