[go: up one dir, main page]
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!)
Revision History for A366581 (Underlined text is an addition; strikethrough text is a deletion.)

Showing entries 1-10 | older changes
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).
(history; published version)
#13 by Wesley Ivan Hurt at Sun Oct 15 08:16:05 EDT 2023
STATUS

reviewed

approved

#12 by Michel Marcus at Sun Oct 15 02:16:31 EDT 2023
STATUS

proposed

reviewed

#11 by Paul F. Marrero Romero at Sat Oct 14 19:13:06 EDT 2023
STATUS

editing

proposed

#10 by Paul F. Marrero Romero at Sat Oct 14 19:12:51 EDT 2023
MATHEMATICA

Table[EulerPhi[PartitionsP[n]], {n, 0, 48}] (* Paul F. Marrero Romero, Oct 14 2023 *)

STATUS

approved

editing

#9 by Joerg Arndt at Sat Oct 14 05:21:37 EDT 2023
STATUS

reviewed

approved

#8 by Stefano Spezia at Sat Oct 14 03:33:26 EDT 2023
STATUS

proposed

reviewed

#7 by Michel Marcus at Sat Oct 14 02:54:09 EDT 2023
STATUS

editing

proposed

#6 by Michel Marcus at Sat Oct 14 02:54:07 EDT 2023
PROG

(PARI) a(n) = eulerphi(numbpart(n)); \\ Michel Marcus, Oct 14 2023

STATUS

approved

editing

#5 by Joerg Arndt at Sat Oct 14 00:06:01 EDT 2023
STATUS

reviewed

approved

#4 by Peter Luschny at Fri Oct 13 23:41:35 EDT 2023
STATUS

proposed

reviewed

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 29 21:13 EDT 2024. Contains 375518 sequences. (Running on oeis4.)