|
Search: id:A091098
|
|
|
| A091098 |
|
Number of primes of the form 4k+1 less than 10^n. |
|
+0
9
|
|
| 1, 11, 80, 609, 4783, 39175, 332180, 2880504, 25423491, 227523275, 2059020280, 18803924340, 173032709183, 1602470783672, 14922284735484, 139619168787795, 1311778575685086, 12369977142579584, 117028833597800689, 1110409801150582707
(list; graph; listen)
|
|
|
OFFSET
|
1,2
|
|
|
REFERENCES
|
Deleglise, Marc; Dusart, Pierre; and Roblot, Xavier-Francois; Counting primes in residue classes. Math. Comp. 73 (2004), no. 247, 1565--1575
|
|
LINKS
|
Eric Weisstein's World of Mathematics, Modular Prime Counting Function
|
|
MATHEMATICA
|
cnt=0; k=0; Table[lim=10^n; While[4k+1<lim, If[ PrimeQ[4k+1], cnt++ ]; k++ ]; cnt, {n, 6}]
|
|
CROSSREFS
|
Cf. A091099 (number of primes of the form 4k+3 less than 10^n).
Sequence in context: A026897 A021024 A127021 this_sequence A091115 A024146 A119364
Adjacent sequences: A091095 A091096 A091097 this_sequence A091099 A091100 A091101
|
|
KEYWORD
|
nonn
|
|
AUTHOR
|
T. D. Noe (noe(AT)sspectra.com), Dec 19 2003
|
|
EXTENSIONS
|
a(10)-a(16) from Robert G. Wilson v (rgwv(AT)rgwv.com), Dec 22 2003
a(17)-a(20) from Marc Deleglise (marc.deleglise(AT)math.univ-lyon1.fr), Jun 28 2007
|
|
|
Search completed in 0.002 seconds
|
