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!)
A359102 a(n) = phi(7 * n)/6. 5
1, 1, 2, 2, 4, 2, 7, 4, 6, 4, 10, 4, 12, 7, 8, 8, 16, 6, 18, 8, 14, 10, 22, 8, 20, 12, 18, 14, 28, 8, 30, 16, 20, 16, 28, 12, 36, 18, 24, 16, 40, 14, 42, 20, 24, 22, 46, 16, 49, 20, 32, 24, 52, 18, 40, 28, 36, 28, 58, 16, 60, 30, 42, 32, 48, 20, 66, 32, 44, 28, 70, 24, 72, 36, 40, 36, 70, 24, 78 (list; graph; refs; listen; history; text; internal format)
OFFSET
1,3
LINKS
Eric Weisstein's World of Mathematics, Moebius Transform.
Eric Weisstein's World of Mathematics, Totient Function.
FORMULA
G.f.: -Sum_{k>=1} mu(7 * k) * x^k / (1 - x^k)^2, where mu() is the Moebius function (A008683).
From Amiram Eldar, Dec 17 2022: (Start)
Multiplicative with a(7^e) = 7^e, and a(p^e) = (p-1)*p^(e-1) if p != 7.
Dirichlet g.f.: zeta(s-1)/(zeta(s)*(1-1/7^s)).
Sum_{k=1..n} a(k) ~ (49/(16*Pi^2)) * n^2. (End)
MATHEMATICA
Array[EulerPhi[7 #]/6 &, 79] (* Michael De Vlieger, Dec 16 2022 *)
PROG
(PARI) a(n) = eulerphi(7*n)/6;
(PARI) my(N=80, x='x+O('x^N)); Vec(-sum(k=1, N, moebius(7*k)*x^k/(1-x^k)^2))
CROSSREFS
Sequence in context: A122977 A275870 A321721 * A003980 A286369 A132801
KEYWORD
nonn,easy,mult
AUTHOR
Seiichi Manyama, Dec 16 2022
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:59 EDT 2024. Contains 374905 sequences. (Running on oeis4.)