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 A334971 #21 May 19 2020 15:08:34 %S A334971 2,7,3,5,31,11,83,17,67,317,29,109,367,41,139,157,293,59,199,211,71, %T A334971 709,911,443,677,503,101,2459,107,337,379,653,409,137,743,149,1097, %U A334971 487,499,863,1609,179,571,191,983,197,631,1559,6581,227,1163,1193,239,751 %N A334971 a(n) is the least prime p such that p+2 is divisible by n-th prime. %H A334971 Zak Seidov, <a href="/A334971/b334971.txt">Table of n, a(n) for n = 1..10000</a> %e A334971 a(1) = 2 because 2+2=4 is divisible by 2 (1st prime), %e A334971 a(2) = 7 because 7+2=9 is divisible by 3 (2nd prime), %e A334971 a(3) = 3 because 3+2=5 is divisible by 5 (3rd prime). %o A334971 (PARI) a(n) = my(p=2); while ((p+2) % prime(n), p=nextprime(p+1)); p; \\ _Michel Marcus_, May 18 2020 %Y A334971 Cf. A052147. %K A334971 nonn %O A334971 1,1 %A A334971 _Zak Seidov_, May 18 2020