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 A280380 #9 May 13 2023 19:13:01
%S A280380 1,2,30,46,374,2146,5945,14855,24702
%N A280380 First occurrence of A280379(k) = n.
%C A280380 n < log(a(n)) for a(n) < 1.1*10^6.
%e A280380 For prime(30)=113, A056171(113) = 14, A104272(12)=107 and A104272(13) = 127, so 14 - 12 = 2 (First occurrence).
%o A280380 (PARI) \\RR[x] is a list of Ramanujan primes, A104272.
%o A280380 {plimit=1.1*10^6;i=n=s=0;
%o A280380 forprime(p=2,plimit,
%o A280380 s++;
%o A280380 if(p==RR[n+1],n++);
%o A280380 if(i==s-primepi(floor(p/2))-n,print(i," ",s);i++)
%o A280380 )
%o A280380 }
%Y A280380 Cf. A056171, A104272.
%K A280380 nonn
%O A280380 0,2
%A A280380 _John W. Nicholson_, Jan 09 2017