Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A005077
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A005077 Sum of 4th powers of primes = 2 mod 3 dividing n. +0
1
0, 16, 0, 16, 625, 16, 0, 16, 0, 641, 14641, 16, 0, 16, 625, 16, 83521, 16, 0, 641, 0, 14657, 279841, 16, 625, 16, 0, 16, 707281, 641, 0, 16, 14641, 83537, 625, 16, 0, 16, 0, 641, 2825761, 16, 0, 14657, 625, 279857 (list; graph; listen)
OFFSET

1,2

FORMULA

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

CROSSREFS

Sequence in context: A109075 A007791 A070570 this_sequence A059060 A059681 A135925

Adjacent sequences: A005074 A005075 A005076 this_sequence A005078 A005079 A005080

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 November 25 14:49 EST 2009. Contains 167514 sequences.


AT&T Labs Research