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.

A353755 a(n) = A062401(n) / gcd(A062401(n), A353752(n)), where A062401(n) = phi(sigma(n)), and A353752(n) = Product_{p^e||n} phi(sigma(p^e)).

Original entry on oeis.org

1, 1, 1, 1, 1, 1, 1, 1, 1, 3, 1, 1, 1, 1, 2, 1, 1, 1, 1, 1, 2, 3, 1, 1, 1, 1, 1, 1, 1, 3, 1, 1, 2, 3, 2, 1, 1, 1, 2, 3, 1, 2, 1, 1, 1, 3, 1, 1, 1, 1, 2, 7, 1, 1, 3, 1, 2, 3, 1, 2, 1, 1, 1, 1, 2, 3, 1, 1, 2, 3, 1, 1, 1, 1, 1, 1, 2, 2, 1, 1, 1, 3, 1, 2, 3, 1, 2, 3, 1, 3, 2, 1, 2, 3, 2, 1, 1, 3, 1, 1, 1, 3, 1, 1, 4
Offset: 1

Views

Author

Antti Karttunen, May 08 2022

Keywords

Comments

Numerator of fraction A062401(n) / A353752(n).

Crossrefs

Cf. A336547 (positions of 1's), A336548 (positions of terms > 1).
Cf. also A353805.

Programs

Formula

a(n) = A062401(n) / A353754(n) = A062401(n) / gcd(A062401(n), A353752(n)).