Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A092843
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A092843 Sum_{k|n, k>1} phi(k-1), where phi() is Euler phi function. +0
1
0, 1, 1, 3, 2, 6, 2, 9, 5, 9, 4, 18, 4, 15, 9, 17, 8, 26, 6, 29, 11, 17, 10, 46, 10, 25, 17, 35, 12, 48, 8, 47, 21, 29, 20, 62, 12, 43, 23, 59, 16, 68, 12, 61, 33, 35, 22, 100, 18, 59, 29, 59, 24, 90, 24, 81, 31, 49, 28, 136, 16, 69, 45, 83, 38, 86, 20, 97, 43, 83, 24, 160, 24, 85 (list; graph; listen)
OFFSET

1,4

EXAMPLE

a(6) = phi(2-1)+phi(3-1)+phi(6-1) = 1+1+4 = 6.

MATHEMATICA

f[n_] := Block[{k = Drop[Divisors[n], 1]}, Plus @@ EulerPhi[k - 1]]; Table[ f[n], {n, 75}] (from Robert G. Wilson v Nov 12 2004)

CROSSREFS

Cf. A069949 A000010.

Adjacent sequences: A092840 A092841 A092842 this_sequence A092844 A092845 A092846

Sequence in context: A071044 A077066 A065228 this_sequence A078589 A077880 A131969

KEYWORD

nonn

AUTHOR

Leroy Quet (qq-quet(AT)mindspring.com), Nov 09 2004

EXTENSIONS

More terms from Robert G. Wilson v (rgwv(AT)rgwv.com), Nov 12 2004

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 12 15:26 EDT 2008. Contains 144830 sequences.


AT&T Labs Research