login
The OEIS is supported by the many generous donors to the OEIS Foundation.

 

Logo
Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A372671 a(n) = phi(6 * n)/2. 1
1, 2, 3, 4, 4, 6, 6, 8, 9, 8, 10, 12, 12, 12, 12, 16, 16, 18, 18, 16, 18, 20, 22, 24, 20, 24, 27, 24, 28, 24, 30, 32, 30, 32, 24, 36, 36, 36, 36, 32, 40, 36, 42, 40, 36, 44, 46, 48, 42, 40, 48, 48, 52, 54, 40, 48, 54, 56, 58, 48, 60, 60, 54, 64, 48, 60, 66, 64, 66, 48, 70, 72, 72, 72, 60 (list; graph; refs; listen; history; text; internal format)
OFFSET
1,2
LINKS
FORMULA
G.f.: Sum_{k>=1} mu(6 * k) * x^k / (1 - x^k)^2, where mu() is the Moebius function (A008683).
Multiplicative with a(p^e) = p^e if p = 2 or 3, and (p-1)*p^(e-1) otherwise.
PROG
(PARI) a(n) = eulerphi(6*n)/2;
(PARI) my(N=80, x='x+O('x^N)); Vec(sum(k=1, N, moebius(6*k)*x^k/(1-x^k)^2))
CROSSREFS
Partial sums gives A372637.
Column k=6 of A372673.
Cf. A008683.
Sequence in context: A102443 A102441 A102440 * A124815 A081328 A179276
KEYWORD
nonn,mult,easy
AUTHOR
Seiichi Manyama, May 10 2024
STATUS
approved

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

License Agreements, Terms of Use, Privacy Policy. .

Last modified August 4 05:39 EDT 2024. Contains 374905 sequences. (Running on oeis4.)