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 A084957 #20 Feb 04 2020 06:35:11
%S A084957 2,2,2,2,1447,9769,17231,17231,32611,18527009,161205841,3123824801,
%T A084957 26813406071,4398156030379,4398156030379
%N A084957 Initial prime of the first prime chain of length n under the iteration x -> 4x + 3.
%C A084957 This is a special case of prime chains generated by f(x) = c*x + d.
%H A084957 D. H. Lehmer, <a href="https://doi.org/10.1112/plms/s3-14A.1.183">On certain chains of primes</a>, Proc. London Math. Soc. (3) 14a 1965 183-186.
%e A084957 a(3) = 2 since 2, f(2) = 11, and f(11) = 47 are primes when f(x) = 4*x + 3.
%t A084957 c[p_] := Block[{k=1, q=4*p+3}, While[ PrimeQ[q], q=4*q+3; k++]; k]; a[n_] := Block[ {p=2}, While[c[p] < n, p = NextPrime@ p]; p]; Array[a, 9] (* _Giovanni Resta_, Mar 21 2017 *)
%o A084957 (PARI) has(p,n)=for(i=2,n, if(!isprime(p=4*p+3), return(0))); 1
%o A084957 a(n)=forprime(p=2,, if(has(p,n), return(p))) \\ _Charles R Greathouse IV_, Jan 20 2017
%Y A084957 Cf. A057330, A057331, A083388, A084954, A084955, A084956, A084958, A084959, A084960, A084961.
%K A084957 nonn,more
%O A084957 1,1
%A A084957 _W. Edwin Clark_, Jun 14 2003
%E A084957 a(11)-a(12) from _Donovan Johnson_, Sep 27 2008
%E A084957 a(13) from _John Cerkan_, Jan 20 2017
%E A084957 a(14)-a(15) from _Giovanni Resta_, Mar 21 2017