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 A365958 #49 Dec 18 2023 13:06:19
%S A365958 2,1,3,3,1,2,2,3,1,3,1,1,3,1,2,2,1,3,3,4,2,2,7,1,2,6,2,2,1,1,6,1,5,5,
%T A365958 1,2,2,4,1,2,7,1,3,1,5,9,3,2,8,1,1,3,4,1,2,1,1,2,4,7,2,3,2,15,1,4,3,
%U A365958 10,3,5,1,1,3,1,1,2,1,2,6,1,2,12,3,1,2
%N A365958 Least k such that 8*n*k+1 is a prime.
%H A365958 Robert Price, <a href="/A365958/b365958.txt">Table of n, a(n) for n = 1..5000</a>
%t A365958 A365958 = {};
%t A365958 Do[k=1; While[!PrimeQ[8 n k+1], k++]; AppendTo[A365958 ,k], {n,85}];
%t A365958 A365958
%o A365958 (PARI) a(n) = my(k=1); while (!isprime(8*n*k+1), k++); k; \\ _Michel Marcus_, Dec 17 2023
%Y A365958 Cf. A016014, A005123.
%Y A365958 A070852 lists the corresponding primes.
%K A365958 nonn
%O A365958 1,1
%A A365958 _Robert Price_, Dec 17 2023