|
|
A372679
|
|
a(n) = phi(15 * n)/8.
|
|
1
|
|
|
1, 1, 3, 2, 5, 3, 6, 4, 9, 5, 10, 6, 12, 6, 15, 8, 16, 9, 18, 10, 18, 10, 22, 12, 25, 12, 27, 12, 28, 15, 30, 16, 30, 16, 30, 18, 36, 18, 36, 20, 40, 18, 42, 20, 45, 22, 46, 24, 42, 25, 48, 24, 52, 27, 50, 24, 54, 28, 58, 30, 60, 30, 54, 32, 60, 30, 66, 32, 66, 30, 70, 36, 72, 36, 75, 36, 60, 36
(list;
graph;
refs;
listen;
history;
text;
internal format)
|
|
|
OFFSET
|
1,3
|
|
LINKS
|
|
|
FORMULA
|
G.f.: Sum_{k>=1} mu(15 * k) * x^k / (1 - x^k)^2, where mu() is the Moebius function (A008683).
Multiplicative with a(p^e) = p^e if p = 3 or 5, and (p-1)*p^(e-1) otherwise.
Sum_{k=1..n} a(k) ~ (225/(64*Pi^2)) * n^2. - Amiram Eldar, May 10 2024
|
|
MATHEMATICA
|
a[n_] := EulerPhi[15 * n]/8; Array[a, 100] (* Amiram Eldar, May 10 2024 *)
|
|
PROG
|
(PARI) a(n) = eulerphi(15*n)/8;
(PARI) my(N=80, x='x+O('x^N)); Vec(sum(k=1, N, moebius(15*k)*x^k/(1-x^k)^2))
|
|
CROSSREFS
|
|
|
KEYWORD
|
nonn,mult,easy
|
|
AUTHOR
|
|
|
STATUS
|
approved
|
|
|
|