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 A272816 #37 Sep 08 2022 08:46:16 %S A272816 3,23,11,31,17,37,23,43,41,61,47,67,53,73,59,79,83,103,89,109,107,127, %T A272816 131,151,137,157,173,193,179,199,191,211,251,271,257,277,263,283,293, %U A272816 313,311,331,317,337,347,367,353,373,359,379,389,409,401,421 %N A272816 Prime pairs of the form (p, p+20). %C A272816 p and p+20 are not necessarily consecutive primes: (887, 907) is the first pair of consecutive primes that belongs to the sequence. %H A272816 Seiichi Manyama, <a href="/A272816/b272816.txt">Table of n, a(n) for n = 1..10000</a> %F A272816 a(2n+1) = A153419(n+1). %e A272816 The prime pairs are (3, 23), (11, 31), (17, 37) etc. %t A272816 Flatten[{#, # + 20}&/@Select[Prime[Range[200]], PrimeQ[# + 20] &]] %o A272816 (Magma) &cat [[p, p+20]: p in PrimesUpTo(1000) | IsPrime(p+20)]; %o A272816 (Python) %o A272816 from gmpy2 import is_prime %o A272816 for n in range(1000): %o A272816 if(is_prime(n) and is_prime(n+20)): %o A272816 print('{}, {}'.format(n,n+20),end=', ') %o A272816 # _Soumil Mandal_, May 14 2016 %Y A272816 Cf. A000040, A153419. %Y A272816 Cf. similar sequences listed in A272815. %Y A272816 Prime pairs of the form (p, p+k): A077800 (k=2), A094343 (k=4), A156274 (k=6), A156320 (k=8), A140445 (k=10), A156323 (k=12), A140446 (k=14), A272815 (k=16), A156328 (k=18), this sequence (k=20), A140447 (k=22). %K A272816 nonn,easy %O A272816 1,1 %A A272816 _Vincenzo Librandi_, May 07 2016 %E A272816 Edited by _Bruno Berselli_, May 12 2016