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.

A257080 n multiplied by the least nonzero digit missing from its factorial base representation: a(n) = n * A257079(n).

Original entry on oeis.org

0, 2, 4, 6, 4, 15, 12, 14, 16, 18, 30, 33, 12, 39, 42, 45, 16, 51, 18, 38, 40, 42, 22, 92, 48, 50, 52, 54, 84, 87, 60, 62, 64, 66, 102, 105, 108, 111, 114, 117, 120, 123, 84, 86, 88, 90, 184, 188, 48, 147, 150, 153, 52, 159, 162, 165, 168, 171, 174, 177, 60, 183, 186, 189, 64, 195, 66, 268, 272, 276, 70, 284, 72
Offset: 0

Views

Author

Antti Karttunen, Apr 15 2015

Keywords

Crossrefs

A255411 gives the fixed points, positions where a(n) = n.
Cf. A257079, A257081 (number of iterations needed before a fixed point is reached).

Programs

Formula

a(n) = n * A257079(n).