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 A231483 #23 Nov 11 2013 03:42:53
%S A231483 9,8,15,18,7,12,15,10,15,18,7,28,15,10,27,12,7,24,15,8,21,18,5,30,15,
%T A231483 8,27,24,11,18,9,10,15,30,13,18,15,10,21,30,7,42,21,10,33,18,7,30,21,
%U A231483 10,9,18,11,30,27,8,33,24,11,48,21,8,21,30
%N A231483 Smallest k > A082467(n) such that n-k and n+k are both prime.
%C A231483 Starting at n=20 just because there are some n<20 without solution like for n=19, for the least k (A082467) it start at 4 as no solution for n<4.
%H A231483 Pierre CAMI, <a href="/A231483/b231483.txt">Table of n, a(n) for n = 20..10000</a>
%o A231483 (PARI) a(n) = {k=1; while(isprime(n-k)*isprime(n+k) == 0, k++); k++; while(isprime(n-k)*isprime(n+k) == 0, k++); k; } \\ _Michel Marcus_, Nov 10 2013
%Y A231483 Cf. A082467.
%K A231483 nonn
%O A231483 20,1
%A A231483 _Pierre CAMI_, Nov 09 2013