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.

A329885 a(n) = A051903(n) mod A002322(n), where A051903 gives the maximal prime exponent of n, and A002322 is Carmichael's lambda (also known as psi).

Original entry on oeis.org

0, 0, 1, 0, 1, 1, 1, 1, 2, 1, 1, 0, 1, 1, 1, 0, 1, 2, 1, 2, 1, 1, 1, 1, 2, 1, 3, 2, 1, 1, 1, 5, 1, 1, 1, 2, 1, 1, 1, 3, 1, 1, 1, 2, 2, 1, 1, 0, 2, 2, 1, 2, 1, 3, 1, 3, 1, 1, 1, 2, 1, 1, 2, 6, 1, 1, 1, 2, 1, 1, 1, 3, 1, 1, 2, 2, 1, 1, 1, 0, 4, 1, 1, 2, 1, 1, 1, 3, 1, 2, 1, 2, 1, 1, 1, 5, 1, 2, 2, 2, 1, 1, 1, 3, 1
Offset: 1

Views

Author

Antti Karttunen, Dec 11 2019

Keywords

Comments

This differs from A051903 at n = 2, 4, 8, 12, 16, 24, 48, 80, 240. Are there any other such n? (None other found <= 201326592.)

Crossrefs

Programs