A062362 a(n) = floor of Sum_{ d divides n } phi(d)/d.

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

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: A337135 A113309 A348955 * A330437 A338648 A269252

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