Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A005079
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A005079 Sum of squares of primes = 1 mod 4 dividing n. +0
1
0, 0, 0, 0, 25, 0, 0, 0, 0, 25, 0, 0, 169, 0, 25, 0, 289, 0, 0, 25, 0, 0, 0, 0, 25, 169, 0, 0, 841, 25, 0, 0, 0, 289, 25, 0, 1369, 0, 169, 25, 1681, 0, 0, 0, 25, 0, 0, 0, 0, 25, 289, 169, 2809, 0, 25, 0, 0, 841, 0, 25, 3721 (list; graph; listen)
OFFSET

1,5

FORMULA

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

CROSSREFS

Sequence in context: A072244 A067669 A068741 this_sequence A108321 A059062 A110416

Adjacent sequences: A005076 A005077 A005078 this_sequence A005080 A005081 A005082

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 December 2 15:58 EST 2008. Contains 150992 sequences.


AT&T Labs Research