Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A005082
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A005082 Sum of primes = 3 mod 4 dividing n. +0
1
0, 0, 3, 0, 0, 3, 7, 0, 3, 0, 11, 3, 0, 7, 3, 0, 0, 3, 19, 0, 10, 11, 23, 3, 0, 0, 3, 7, 0, 3, 31, 0, 14, 0, 7, 3, 0, 19, 3, 0, 0, 10, 43, 11, 3, 23, 47, 3, 7, 0, 3, 0, 0, 3, 11, 7, 22, 0, 59, 3, 0, 31, 10, 0, 0, 14, 67, 0, 26, 7, 71 (list; graph; listen)
OFFSET

1,3

FORMULA

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

CROSSREFS

Sequence in context: A111787 A091921 A037285 this_sequence A050452 A151665 A079201

Adjacent sequences: A005079 A005080 A005081 this_sequence A005083 A005084 A005085

KEYWORD

nonn

AUTHOR

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

page 1

Search completed in 0.002 seconds

Lookup | Welcome | Find friends | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Transforms | Puzzles | Hot | Classics
More pages | Superseeker | Maintained by N. J. A. Sloane (njas@research.att.com)

Last modified December 17 23:40 EST 2009. Contains 171025 sequences.


AT&T Labs Research