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 A076367 #17 Mar 02 2025 08:00:04
%S A076367 2,3,3,5,5,5,7,7,7,11,11,11,11,11,13,13,13,17,17,17,17,17,19,19,19,23,
%T A076367 23,23,23,23,29,29,29,29,29,29,29,31,31,31,37,37,37,37,37,37,37,41,41,
%U A076367 41,41,41,43,43,43,47,47,47,47,47,53,53,53,53,53,53,53,59,59,59,59,59
%N A076367 Primes with subscripts from the Bonse sequence.
%C A076367 This and sequence A060646 was used to prove that 30 is the largest number whose RRS does not contain composite numbers. See A048597, A060646 and corresponding References.
%H A076367 Amiram Eldar, <a href="/A076367/b076367.txt">Table of n, a(n) for n = 1..10000</a>
%F A076367 a(n) = prime(A060646(n)).
%t A076367 c[x_, j_] := x+1-(j+Prime[j]); c[x, 0]=x; a=1000; t=Table[0, {a}]; t1=Table[0, {a}]; Table[fl=1; (*Print["% ", u, " #"]; *)Do[s=c[u, n]; If[Equal[fl, 1]&&Equal[Sign[s], -1], Print[n]; t[[u]]=n; t1[[u]]=Prime[n]; fl=0], {n, 1, u}], {u, 1, a}] //t (*=A060646*)//t1 (* =A076367 *)
%Y A076367 Cf. A048597, A060646, A076368. See also A076366.
%K A076367 nonn
%O A076367 1,1
%A A076367 _Labos Elemer_, Oct 14 2002