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 A104883 #48 Jun 14 2022 02:26:25
%S A104883 4,5,8,7,24,11,54,51,22,117,222,19,114,87,46,207,216,61,258,291,128,
%T A104883 591,336,43,306,423,136,519,492,97,888,951,146,537,318,163,1656,561,
%U A104883 238,699,732,191,864,1365,286,1353,1674,229,1422,1671,802,2451,876,283,576,2577
%N A104883 a(n) is the smallest number k such that A082467(k) = n.
%C A104883 This is simply the smallest inverse to A082467. Note that A082467 has offset 4. - _N. J. A. Sloane_, Jan 15 2020
%H A104883 Amiram Eldar, <a href="/A104883/b104883.txt">Table of n, a(n) for n = 1..1000</a>
%t A104883 f[n_] := Block[{k}, If[ OddQ[n], k = 2, k = 1]; While[ !PrimeQ[n - k] || !PrimeQ[n + k], k += 2]; k]; t = Table[ f[n], {n, 4, 2600}]; u = Table[0, {60}]; Do[a = t[[n]]; If[a < 61 && u[[a]] == 0, u[[a]] = n + 3], {n, 2597}]; u
%o A104883 (PARI) a082467(n) = my(k=1); while(isprime(n-k)*isprime(n+k) == 0, k++); k;
%o A104883 a(n) = my(k=4); while (a082467(k) != n, k++); k; \\ _Michel Marcus_, Feb 12 2020
%Y A104883 Cf. A082467.
%Y A104883 Records are in A104884.
%K A104883 nonn
%O A104883 1,1
%A A104883 _Benoit Cloitre_ and _Robert G. Wilson v_, Mar 28 2005
%E A104883 Definition corrected by _Giovanni Resta_. - _N. J. A. Sloane_, Jan 15 2020