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 A330428 #29 Dec 19 2019 07:45:23
%S A330428 5,211,38501,413353,10938023,142414669,163710121,8835528511,
%T A330428 31587561361,343834606051,1480975873513,26923643849953
%N A330428 Smallest prime p such that both nearest primes up and down are farther away than n*log(p).
%C A330428 For these numbers, the name "Lowest Frogger Primes" LFP(n) is suggested because (frog) jumps with a length greater than n times the local average are required to bridge the gaps (logs).
%o A330428 (PARI) {my(npp=2,np=3,n=1);forprime(p=5,10^9,my(d=log(p)*n);if(np-npp>d&&p-np>d,print(np,", ");n++);npp=np;np=p)} \\ _Hugo Pfoertner_, Dec 14 2019
%Y A330428 Cf. A288908 (with 1*log(P)), A330426 (with 2*log(P)), A330427 (with 3*log(P)).
%Y A330428 Cf. A023186, A120937.
%K A330428 nonn,more,hard
%O A330428 1,1
%A A330428 _Steven M. Altschuld_, Dec 14 2019
%E A330428 a(5)-a(9) from _Hugo Pfoertner_, Dec 14 2019
%E A330428 a(10) from _Hugo Pfoertner_, Dec 16 2019
%E A330428 a(11)-a(12) from _Giovanni Resta_, Dec 19 2019