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.

A328311 a(n) = 1 + A051903(A003415(n)) - A051903(n), a(1) = 0 by convention.

Original entry on oeis.org

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

Views

Author

Antti Karttunen, Oct 13 2019

Keywords

Comments

All terms are nonnegative because taking the arithmetic derivative (A003415) of n may decrease its "degree" (i.e., its maximal exponent, A051903) by at most one, and in many cases may also increase it, or keep it same.

Crossrefs

One more than A328310.
Cf. A328320 (indices of zeros), A328321 (of nonzero terms).

Programs

Formula

a(1) = 0, for n > 1, a(n) = 1 + A051903(A003415(n)) - A051903(n).
For n > 1, a(n) = 1 + A328310(n).