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 A096482 #30 Jun 05 2025 20:38:18
%S A096482 3,67,31,401,241,211,773,2221,1913,7649,3229,1669,2477,10009,5749,
%T A096482 33647,9973,14107,60821,130729,16141,15683,113233,86629,95651,74959,
%U A096482 35617,388403,214993,557093,248909,637003,296843,448451,186481,1145899,1283603,1845637,795349,542603
%N A096482 a(n) = prime(prime(A096480(n))).
%C A096482 a(n) = prime(p) where p is the smallest prime such that prime(p+1) - prime(p) = 2*n.
%C A096482 Both a(n) and a(n) + 2*n are primes while pi(a(n)) = A096481(n) and pi(pi(a(n))) = A096480(n).
%H A096482 Amiram Eldar, <a href="/A096482/b096482.txt">Table of n, a(n) for n = 1..214</a> (terms 1..100 from Andrew Howroyd)
%F A096482 a(n) = A006450(A096480(n)) = prime(A096481(n)).
%F A096482 a(n) + 2*n = prime(1 + prime(A096480(n))).
%e A096482 a(2) = 67 = prime(19) since prime(19+1) - prime(19) = 71 - 67 = 2*2 and 19 is the smallest prime with this property.
%t A096482 Prime[Prime[Table[Min[Flatten[Position[Table[Prime[Prime[n]+1]- Prime[Prime[n]], {n, 1, 5000}], 2*j]]], {j, 1, 100}]]]
%o A096482 (PARI) a(n) = {my(p=2); while((prime(p+1)-prime(p))!=2*n, p=nextprime(p+1)); prime(p)} \\ _Klaus Brockhaus_, Jun 27 2004
%o A096482 (PARI) a(n) = {my(p=2,k=1); forprime(q=3, oo, if(q==p+2*n && isprime(k), return(p)); p=q; k++)} \\ _Andrew Howroyd_, Dec 16 2024
%Y A096482 Cf. A000040, A006450, A073124, A072677, A096477, A096478, A096479, A096480, A096481.
%K A096482 nonn
%O A096482 1,1
%A A096482 _Labos Elemer_, Jun 23 2004
%E A096482 a(31)-a(36) from _Klaus Brockhaus_, Jun 27 2004
%E A096482 a(37) onwards from _Andrew Howroyd_, Dec 16 2024