Year-end appeal: Please make a donation to the OEIS Foundation to support ongoing development and maintenance of the OEIS. We are now in our 61st year, we have over 378,000 sequences, and we’ve reached 11,000 citations (which often say “discovered thanks to the OEIS”).
%I #10 Jun 10 2024 17:45:16
%S 2,3,5,7,9,11,13,17,19,23,25,29,31,37,41,43,47,49,53,57,59,61,67,71,
%T 73,79,83,87,89,93,97,101,103,107,109,113,117,121,127,131,137,139,145,
%U 149,151,157,163,167,169,173,177,179,181,189,191,193,197,199
%N "Compact" numbers: see reference for definition.
%C The old entry with this sequence number was a duplicate of A062329.
%H Ray Chandler, <a href="/A070566/b070566.txt">Table of n, a(n) for n = 1..10000</a>
%H Bhupinder Singh Anand, <a href="http://alixcomsi.com/A_Minimal_Prime.pdf">A Minimal Prime Generating Theorem that suggests the Prime Difference is O(pi(p(sqrt(n)))</a>
%H Sean A. Irvine, <a href="https://github.com/archmageirvine/joeis/blob/master/src/irvine/oeis/a070/A070566.java">Java program</a> (github)
%Y Cf. A079603, A145554.
%K nonn
%O 1,1
%A _N. J. A. Sloane_, Sep 22 2008