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 A137796 #18 Feb 03 2024 00:51:13
%S A137796 17,19,29,31,41,59,71,101,139,151,179,211,239,251,269,281,409,421,431,
%T A137796 479,491,619,631,739,809,941,1009,1021,1051,1289,1291,1439,1459,1471,
%U A137796 1499,1511,1571,1609,1709,1721,1789,1889,1901,1999,2099,2141,2281,2411
%N A137796 Prime numbers p such that p + 12 and p - 12 are primes.
%H A137796 Daniel Starodubtsev, <a href="/A137796/b137796.txt">Table of n, a(n) for n = 1..10000</a>
%F A137796 A092216 INTERSECT A046133. - _R. J. Mathar_, May 03 2008
%e A137796 17 + 12 = 29 (a prime), 17 - 12 = 5 (a prime);
%e A137796 19 + 12 = 31 (a prime), 19 - 12 = 7 (a prime).
%p A137796 isA092216 := proc(n) RETURN(isprime(n) and isprime(n-12) ) ; end: isA046133 := proc(n) RETURN(isprime(n) and isprime(n+12) ) ; end: isA137796 := proc(n) RETURN(isA092216(n) and isA046133(n)) ; end: for i from 1 to 400 do if isA137796(ithprime(i)) then printf("%d,",ithprime(i)) ; fi ; od: # _R. J. Mathar_, May 03 2008
%t A137796 a=12; Select[Table[Prime[n],{n,10^3}], PrimeQ[ #-a] && PrimeQ[ #+a] &]
%o A137796 (PARI) lista(nn) = forprime(p=2, nn, if (isprime(p-12) && isprime(p+12), print1(p, ", "))); \\ _Michel Marcus_, Oct 04 2015
%Y A137796 Cf. A092216, A046133. Note that this is different from A137873.
%K A137796 nonn
%O A137796 1,1
%A A137796 _Vladimir Joseph Stephan Orlovsky_, Apr 28 2008
%E A137796 Corrected and extended by _R. J. Mathar_, May 03 2008