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 A275629 #23 Aug 12 2022 09:17:21
%S A275629 5,17,17,47,863,863,887,887,887,887,133877,858707,886013,11891003,
%T A275629 11891003,324840323,1364103977,7151489963,7151489963,10402068437,
%U A275629 10402068437,875858298023,7859437730303,7859437730303,10784807012723,304858842631367,1939577853386297,4237718864973557
%N A275629 The least odd prime leaving a prime remainder when divided by each of the first n odd primes.
%H A275629 Bert Dobbelaere, <a href="/A275629/b275629.txt">Table of n, a(n) for n = 1..36</a>
%H A275629 J. M. Bergot (Proposer), <a href="http://math.stackexchange.com/questions/1872067/the-least-odd-prime-leaving-prime-remainder-when-divided-by-the-first-n-odd-pr">The least odd prime leaving prime remainder when divided by the first nn odd primes</a>, Mathematics Stack Exchange, 2016.
%e A275629 47 mod 3,5,7,11 is 2,2,5,3, which are all primes.
%o A275629 (Perl) use ntheory ":all"; sub a275629 { my($n)=@_; my $it=prime_iterator(3); my @fnp = map { $it->() } 1..$n; while (1) { $p=$it->(); return $p if vecall {is_prime($p%$_)} @fnp; } } say a275629($_) for 1..20; # _Dana Jacobsen_, Aug 09 2016
%K A275629 nonn
%O A275629 1,1
%A A275629 _N. J. A. Sloane_, Aug 07 2016
%E A275629 Corrected and extended by _Dana Jacobsen_, Aug 09 2016
%E A275629 a(22) onwards from _Bert Dobbelaere_, Sep 13 2019