Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A005083
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A005083 Sum of squares of primes = 3 mod 4 dividing n. +0
1
0, 0, 9, 0, 0, 9, 49, 0, 9, 0, 121, 9, 0, 49, 9, 0, 0, 9, 361, 0, 58, 121, 529, 9, 0, 0, 9, 49, 0, 9, 961, 0, 130, 0, 49, 9, 0, 361, 9, 0, 0, 58, 1849, 121, 9, 529, 2209, 9, 49, 0, 9, 0, 0, 9, 121, 49, 370, 0, 3481, 9, 0, 961, 58 (list; graph; listen)
OFFSET

1,3

FORMULA

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

CROSSREFS

Sequence in context: A132267 A021115 A073052 this_sequence A050453 A013529 A103636

Adjacent sequences: A005080 A005081 A005082 this_sequence A005084 A005085 A005086

KEYWORD

nonn

AUTHOR

njas

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 August 19 23:53 EDT 2008. Contains 142930 sequences.


AT&T Labs Research