The OEIS Foundation is supported by donations from users of the OEIS and by a grant from the Simons Foundation.

 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 A062362 a(n) = floor of Sum_{ d divides n } phi(d)/d. 1
 1, 1, 1, 2, 1, 2, 1, 2, 2, 2, 1, 3, 1, 2, 3, 3, 1, 3, 1, 3, 3, 2, 1, 4, 2, 2, 3, 3, 1, 4, 1, 3, 3, 2, 3, 4, 1, 2, 3, 4, 1, 4, 1, 3, 4, 2, 1, 5, 2, 3, 3, 3, 1, 4, 3, 4, 3, 2, 1, 6, 1, 2, 4, 4, 3, 4, 1, 3, 3, 5, 1, 5, 1, 2, 4, 3, 3, 4, 1, 5, 3, 2, 1, 6, 3, 2, 3, 4, 1, 6, 3, 3, 3, 2, 3, 5, 1, 4, 4, 5, 1, 4, 1, 4, 5 (list; graph; refs; listen; history; text; internal format)
 OFFSET 1,4 REFERENCES D. M. Burton, Elementary Number Theory, Allyn and Bacon Inc. Boston, MA, 1976, p. 152. LINKS Harry J. Smith, Table of n, a(n) for n=1,...,1000 MAPLE A062362 := proc(n) add(numtheory[phi](d)/d, d=numtheory[divisors](n)) ; floor(%) ; end: # R. J. Mathar, Jun 28 2009 PROG (PARI) j=[]; for(n=1, 250, j=concat(j, floor(sumdiv(n, d, eulerphi(d)/d)))); j (PARI) { for (n=1, 1000, write("b062362.txt", n, " ", floor(sumdiv(n, d, eulerphi(d)/d))) ) } \\ Harry J. Smith, Aug 06 2009 CROSSREFS Sequence in context: A068108 A337135 A113309 * A330437 A269252 A291150 Adjacent sequences:  A062359 A062360 A062361 * A062363 A062364 A062365 KEYWORD easy,nonn AUTHOR Jason Earls, Jul 07 2001 EXTENSIONS Definition clarified by R. J. Mathar, Jun 28 2009 STATUS approved

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recent
The OEIS Community | Maintained by The OEIS Foundation Inc.

Last modified April 19 01:39 EDT 2021. Contains 343099 sequences. (Running on oeis4.)