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 A320705 #11 Nov 28 2024 11:59:45 %S A320705 30,62,66,137,146,150,162,223,250,283,309,350,360,382,402,410,424,434, %T A320705 503,514,526,532,536,570,610,649,654,666,687,704,706,747,780,790,867, %U A320705 906,919,929,967,978,981,992,1011,1023,1038,1042,1057,1072,1133,1154,1160,1177,1184 %N A320705 Indices of primes followed by a gap (distance to next larger prime) of 14. %C A320705 Indices of the primes listed in A031932. %H A320705 Vincenzo Librandi, <a href="/A320705/b320705.txt">Table of n, a(n) for n = 1..8000</a> %H A320705 <a href="/index/Pri#gaps">Index entries for primes, gaps between</a>. %F A320705 a(n) = A000720(A031932(n)). %F A320705 A320705 = { i > 0 | prime(i+1) = prime(i) + 14 }. %t A320705 Select[Range[1500], Prime[#] + 14 == Prime[# + 1] &] (* _Vincenzo Librandi_, Mar 19 2019 *) %t A320705 Position[Differences[Prime[Range[1200]]],14]//Flatten (* _Harvey P. Dale_, Nov 28 2024 *) %o A320705 (PARI) A(N=100,g=14,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 A320705 (Magma) [n: n in [1..1500] | NthPrime(n+1) - NthPrime(n) eq 14]; // _Vincenzo Librandi_, Mar 19 2019 %Y A320705 Equals A000720 o A031932. %Y A320705 Row 7 of A174349. %Y A320705 Indices of 14's in A001223. %Y A320705 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 A320705 nonn %O A320705 1,1 %A A320705 _M. F. Hasler_, Oct 19 2018