|
|
A181671
|
|
Number of Ramanujan primes less than 10^n.
|
|
2
|
|
|
1, 10, 72, 559, 4459, 36960, 316066, 2760321, 24491666, 220098288, 1998400235, 18299775876, 168773875190, 1566017986235, 14606736768049, 136860923837558, 1287462389890262
(list;
graph;
refs;
listen;
history;
text;
internal format)
|
|
|
OFFSET
|
1,2
|
|
LINKS
|
|
|
MATHEMATICA
|
nn=50000; t=Table[0, {nn}]; s=0; Do[If[PrimeQ[k], s++]; If[PrimeQ[k/2], s--]; If[s<nn, t[[s+1]]=k], {k, Prime[3*nn]}]; t=t+1; i=1; Table[While[t[[i]]<10^n, i++]; i-1, {n, Floor[Log[10, t[[-1]]]]}]
|
|
PROG
|
(Perl) use ntheory ":all"; for my $e (1..9) { say "$e ", scalar(@{ramanujan_primes(10**$e)}); } # Dana Jacobsen, May 10 2015
# To control memory use at cost of speed:
(Perl) use ntheory ":all"; my($n, $inc, $start, $sum)=(1e10, 1e9, 0, 0); while ($start < $n) { $sum += scalar(@{ramanujan_primes($start, $start+$inc-1)}); $start += $inc; } say $sum; # Dana Jacobsen, May 10 2015
(Perl) use ntheory ":all"; say ramanujan_prime_count(10**$_) for 1..11; # Dana Jacobsen, Jan 03 2016
|
|
CROSSREFS
|
Cf. A190502 (Number of Ramanujan primes <= 2^n).
|
|
KEYWORD
|
nonn,more
|
|
AUTHOR
|
|
|
EXTENSIONS
|
|
|
STATUS
|
approved
|
|
|
|