Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A069194
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A069194 Sum_{d|n} n/d*phi(n)/phi(d). +0
1
1, 3, 7, 13, 21, 21, 43, 53, 64, 63, 111, 91, 157, 129, 147, 213, 273, 192, 343, 273, 301, 333, 507, 371, 526, 471, 577, 559, 813, 441, 931, 853, 777, 819, 903, 832, 1333, 1029, 1099, 1113, 1641, 903, 1807, 1443, 1344, 1521, 2163, 1491, 2108, 1578, 1911, 2041 (list; graph; listen)
OFFSET

1,2

MAPLE

for i from 1 to 100 do d := divisors(i): a[i] := i*phi(i)*sum(1/d[j]/phi(d[j]), j=1..nops(d)) od:seq(a[j], j=1..100);

CROSSREFS

Cf. A000010.

Sequence in context: A022777 A033154 A076950 this_sequence A100531 A032409 A073896

Adjacent sequences: A069191 A069192 A069193 this_sequence A069195 A069196 A069197

KEYWORD

mult,easy,nonn

AUTHOR

Vladeta Jovovic (vladeta(AT)Eunet.yu), Apr 10 2002

EXTENSIONS

More terms from Sascha Kurz (sascha.kurz(AT)uni-bayreuth.de), Jan 03 2003

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