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

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

1,10

FORMULA

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

CROSSREFS

Sequence in context: A138253 A085737 A191904 * A073490 A194285 A135341

Adjacent sequences:  A005087 A005088 A005089 * A005091 A005092 A005093

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 14 09:18 EST 2012. Contains 205614 sequences.