Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A068970
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A068970 Sum(phi(d^4)); d|n. +0
1
1, 9, 55, 137, 501, 495, 2059, 2185, 4429, 4509, 13311, 7535, 26365, 18531, 27555, 34953, 78609, 39861, 123463, 68637, 113245, 119799, 267675, 120175, 313001, 237285, 358723, 282083, 682893, 247995, 893731, 559241, 732105, 707481 (list; graph; listen)
OFFSET

1,2

FORMULA

Also Sum( d|n, d^m*phi(d^(4-m))) for m=0, 1, 2, 3

Multiplicative with a(p^e) = 1 + p^3 + (p-1)(p^(4e)-1)/(p^4-1)

CROSSREFS

Adjacent sequences: A068967 A068968 A068969 this_sequence A068971 A068972 A068973

Sequence in context: A093847 A058849 A058852 this_sequence A141530 A016269 A005770

KEYWORD

easy,nonn,mult

AUTHOR

Benoit Cloitre (benoit7848c(AT)orange.fr), Apr 06 2002

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 October 5 16:50 EDT 2008. Contains 144613 sequences.


AT&T Labs Research