Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A075490
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A075490 Sum[phi[n]^j,j = 1..n]. +0
1
1, 2, 14, 30, 1364, 126, 335922, 87380, 12093234, 1398100, 111111111110, 22369620, 116719860413532, 94036996914, 40210710958664, 321685687669320, 314824432191309680912, 121871948002098, 749896248023298716143374 (list; graph; listen)
OFFSET

1,2

EXAMPLE

n=5: phi[5]=4, 4+16+64+256+1024=1364 n=22: phi[22]=10, a(22)=10+100+...10^22=11111111111111111111110, n=101: a(101)=1010101.....010100, etc.

MATHEMATICA

Table[Apply[Plus, Table[EulerPhi[w]^j, {j, 1, w}]], {w, 1, 25}]

CROSSREFS

Cf. A000010.

Adjacent sequences: A075487 A075488 A075489 this_sequence A075491 A075492 A075493

Sequence in context: A038341 A075718 A093794 this_sequence A031301 A083015 A050591

KEYWORD

easy,nonn

AUTHOR

Labos E. (labos(AT)ana.sote.hu), Sep 26 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 11 09:12 EDT 2008. Contains 144832 sequences.


AT&T Labs Research