|
|
A066339
|
|
Number of primes p of the form 4m+1 with p <= n.
|
|
9
|
|
|
0, 0, 0, 0, 1, 1, 1, 1, 1, 1, 1, 1, 2, 2, 2, 2, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 4, 4, 4, 4, 4, 4, 4, 4, 5, 5, 5, 5, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 7, 7, 7, 7, 7, 7, 7, 7, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 10, 10, 10, 10, 10, 10, 10, 10, 11, 11, 11
(list;
graph;
refs;
listen;
history;
text;
internal format)
|
|
|
OFFSET
|
1,13
|
|
COMMENTS
|
Asymptotic expansion: a(n) ~ pi(n)/2 ~ n/(2log(n)) (pi(n) is in sequence A000720).
|
|
LINKS
|
|
|
FORMULA
|
|
|
MATHEMATICA
|
Table[ Length[ Select[ Union[ Table[ Prime[ PrimePi[i]], {i, 2, n}]], Mod[ #, 4] == 1 & ]], {n, 2, 100} ]
|
|
PROG
|
(PARI) for(n=1, 200, print1(sum(i=1, n, if((i*isprime(i)-1)%4, 0, 1)), ", "))
(Haskell)
a066339 n = a066339_list !! (n-1)
a066339_list = scanl1 (+) $ map a079260 [1..]
|
|
CROSSREFS
|
|
|
KEYWORD
|
nonn
|
|
AUTHOR
|
Sharon Sela (sharonsela(AT)hotmail.com), Jan 01 2002
|
|
EXTENSIONS
|
|
|
STATUS
|
approved
|
|
|
|