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!)
A366581 a(n) = phi(p(n)), where phi is Euler's totient function (A000010) and p(n) is the number of partitions of n (A000041). 0
1, 1, 1, 2, 4, 6, 10, 8, 10, 8, 12, 24, 60, 100, 72, 80, 120, 180, 240, 168, 360, 240, 332, 1000, 720, 880, 672, 1008, 1560, 3280, 1864, 3100, 4840, 5544, 4920, 8800, 17976, 16800, 18480, 12960, 10584, 23040, 24160, 37800, 57600, 43440, 34560, 49896, 84144 (list; graph; refs; listen; history; text; internal format)
OFFSET
0,4
LINKS
FORMULA
a(n) = A000010(A000041(n)).
MATHEMATICA
Table[EulerPhi[PartitionsP[n]], {n, 0, 48}] (* Paul F. Marrero Romero, Oct 14 2023 *)
PROG
(PARI) a(n) = eulerphi(numbpart(n)); \\ Michel Marcus, Oct 14 2023
CROSSREFS
Sequence in context: A093081 A242521 A338298 * A073659 A073661 A079052
KEYWORD
nonn
AUTHOR
Sean A. Irvine, Oct 13 2023
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 27 05:51 EDT 2024. Contains 372009 sequences. (Running on oeis4.)