login
This site is supported by donations to The OEIS Foundation.
Logo

Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A005089 Number of distinct primes = 1 mod 4 dividing n. 3
0, 0, 0, 0, 1, 0, 0, 0, 0, 1, 0, 0, 1, 0, 1, 0, 1, 0, 0, 1, 0, 0, 0, 0, 1, 1, 0, 0, 1, 1, 0, 0, 0, 1, 1, 0, 1, 0, 1, 1, 1, 0, 0, 0, 1, 0, 0, 0, 0, 1, 1, 1, 1, 0, 1, 0, 0, 1, 0, 1, 1, 0, 0, 0, 2, 0, 0, 1, 0, 1, 0, 0, 1, 1, 1, 0, 0, 1, 0, 1, 0, 1, 0, 0, 2, 0, 1, 0, 1, 1, 1, 0, 0, 0, 1, 0, 1, 0, 0, 1, 1, 1 (list; graph; refs; listen; history; internal format)
OFFSET

1,65

FORMULA

Additive with a(p^e) = 1 if p = 1 (mod 4), 0 otherwise.

MATHEMATICA

f[n_]:=Length@Select[If[n==1, {}, FactorInteger[n]], Mod[#[[1]], 4]==1&]; Table[f[n], {n, 102}] (* Ray Chandler, Dec 18 2011 *)

PROG

(PARI) for(n=1, 100, print1(sumdiv(n, d, isprime(d)*if((d-1)%4, 0, 1)), ", "))

CROSSREFS

Cf. A001221, A005091.

Sequence in context: A165766 A102082 A030199 * A119395 A087476 A035162

Adjacent sequences:  A005086 A005087 A005088 * A005090 A005091 A005092

KEYWORD

nonn

AUTHOR

N. J. A. Sloane (njas(AT)research.att.com).

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Transforms | Puzzles | Hot | Classics
Recent Additions | More pages | Superseeker | Maintained by The OEIS Foundation Inc.

Content is available under The OEIS End-User License Agreement .

Last modified February 13 15:00 EST 2012. Contains 205519 sequences.