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 A128073 #14 Jun 13 2021 03:21:59
%S A128073 5,17,61,673,919,2089,86939
%N A128073 Numbers k such that (3^k + 16^k)/19 is prime.
%C A128073 All terms are primes.
%C A128073 a(8) > 10^5 - _Robert Price_, Jun 29 2013
%t A128073 k=16; Do[ p=Prime[n]; f=(3^p+k^p)/(k+3); If[ PrimeQ[f], Print[p]], {n,1,100} ]
%o A128073 (PARI) is(n)=isprime((3^n+16^n)/19) \\ _Charles R Greathouse IV_, Feb 17 2017
%Y A128073 Cf. A007658 (numbers k such that (3^k + 1)/4 is prime).
%Y A128073 Cf. A057469 (numbers k such that (3^k + 2^k)/5 is prime).
%Y A128073 Cf. A122853 (numbers k such that (3^k + 5^k)/8 is prime).
%Y A128073 Cf. A128066, A128067, A128068, A128069, A128070, A128071, A128072, A128074, A128075.
%Y A128073 Cf. A059801 (numbers k such that 4^k - 3^k is prime).
%Y A128073 Cf. A121877 (numbers k such that (5^k - 3^k)/2 is prime).
%Y A128073 Cf. A128024, A128025, A128026, A128027, A128028, A128029, A128030, A128031, A128032.
%K A128073 hard,more,nonn
%O A128073 1,1
%A A128073 _Alexander Adamchuk_, Feb 14 2007
%E A128073 a(5) from _Alexander Adamchuk_, Feb 14 2007
%E A128073 a(6) and a(7) from _Robert Price_, Jun 29 2013