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.

A342003 Maximal exponent in the prime factorization of the arithmetic derivative of n: a(n) = A051903(A003415(n)).

Original entry on oeis.org

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

Views

Author

Antti Karttunen, Mar 01 2021

Keywords

Crossrefs

Cf. A000040 (indices of zeros), A328234 (of ones), A328393 (of the terms < 2).

Programs

Formula

a(n) = A051903(A003415(n)).
a(n) = A051903(n) + A328310(n).
a(n) = 1 iff A341994(n) = 1.