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

 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 A349676 Iterated Pillai's arithmetical function: a(1) = 2, for n >= 2, a(n) = A018804(a(n-1)). 0
 2, 3, 5, 9, 21, 65, 225, 1365, 14625, 223125, 5630625, 376228125, 38759765625, 3471767578125, 934835712890625, 497199051298828125, 613613372156103515625, 2538878964828409423828125, 25280374785655551910400390625, 243473923053903449878692626953125, 9202204429788304689688510894775390625 (list; graph; refs; listen; history; text; internal format)
 OFFSET 1,1 LINKS FORMULA a(1) = 2, a(n) = A018804(a(n-1)) for n >= 2. EXAMPLE a(5) = f(f(f(f(a(1))))) = 21. Here f represents A018804. MATHEMATICA f[p_, e_] := (e*(p - 1)/p + 1) * p^e; pil[n_] := Times @@ f @@@ FactorInteger[n]; NestList[pil, 2, 20] (* Amiram Eldar, Nov 24 2021 *) PROG (PARI) f(n) = sumdiv(n, d, n*eulerphi(d)/d); \\ A018804 lista(nn) = my(a = 2); for (n=1, nn, print1(a, ", "); a = f(a); ); \\ Michel Marcus, Nov 24 2021 CROSSREFS Cf. A018804. Sequence in context: A110542 A101542 A101581 * A287915 A354141 A105180 Adjacent sequences: A349673 A349674 A349675 * A349677 A349678 A349679 KEYWORD nonn AUTHOR Ctibor O. Zizka, Nov 24 2021 EXTENSIONS More terms from Michel Marcus, Nov 24 2021 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.

Last modified February 7 06:02 EST 2023. Contains 360112 sequences. (Running on oeis4.)