cp's OEIS Frontend

This is a front-end for the Online Encyclopedia of Integer Sequences, made by Christian Perfect. The idea is to provide OEIS entries in non-ancient HTML, and then to think about how they're presented visually. The source code is on GitHub.

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).

Original entry on oeis.org

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
Offset: 0

Views

Author

Sean A. Irvine, Oct 13 2023

Keywords

Crossrefs

Programs

Formula

a(n) = A000010(A000041(n)).