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!)
A333698 G.f.: Sum_{k>=1} phi(k) * x^prime(k) / (1 - x^prime(k)). 0
0, 1, 1, 1, 2, 2, 2, 1, 1, 3, 4, 2, 2, 3, 3, 1, 6, 2, 4, 3, 3, 5, 6, 2, 2, 3, 1, 3, 4, 4, 10, 1, 5, 7, 4, 2, 4, 5, 3, 3, 12, 4, 6, 5, 3, 7, 8, 2, 2, 3, 7, 3, 8, 2, 6, 3, 5, 5, 16, 4, 6, 11, 3, 1, 4, 6, 18, 7, 7, 5, 8, 2, 12, 5, 3, 5, 6, 4, 10, 3, 1, 13, 22, 4, 8 (list; graph; refs; listen; history; text; internal format)
OFFSET
1,5
LINKS
FORMULA
If n = Product (p_j^k_j) then a(n) = Sum (phi(pi(p_j))).
EXAMPLE
a(63) = a(3^2 * 7) = a(prime(2)^2 * prime(4)) = A000010(2) + A000010(4) = 1 + 2 = 3.
MATHEMATICA
nmax = 85; CoefficientList[Series[Sum[EulerPhi[k] x^Prime[k]/(1 - x^Prime[k]), {k, 1, nmax}], {x, 0, nmax}], x] // Rest
a[n_] := Plus @@ (EulerPhi[PrimePi[#[[1]]]] & /@ FactorInteger[n]); Table[a[n], {n, 85}]
PROG
(PARI) a(n) = my(f=factor(n)); sum(k=1, #f~, eulerphi(primepi(f[k, 1]))); \\ Michel Marcus, Apr 03 2020
CROSSREFS
Sequence in context: A076545 A162246 A277447 * A213126 A118400 A159853
KEYWORD
nonn
AUTHOR
Ilya Gutkovskiy, Apr 02 2020
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 April 24 20:08 EDT 2024. Contains 371963 sequences. (Running on oeis4.)