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.

A219655 Greatest inverse of A219652; a(n) = maximal i such that A219652(i) = n.

Original entry on oeis.org

0, 1, 3, 5, 7, 11, 15, 19, 23, 25, 29, 33, 37, 41, 47, 51, 55, 59, 65, 71, 77, 83, 89, 95, 101, 107, 115, 119, 121, 125, 129, 133, 137, 143, 147, 151, 155, 161, 167, 173, 179, 185, 191, 197, 203, 211, 217, 225, 233, 239, 243, 247, 251, 257, 263, 269, 275, 281
Offset: 0

Views

Author

Antti Karttunen, Nov 25 2012

Keywords

Crossrefs

Cf. A219653 for the least inverse. A219654 gives the first differences.
This sequence is based on factorial number system: A007623. Analogous sequence for binary system: A173601, for Zeckendorf expansion: A219645.

Formula

a(n) = A219653(n) + A219654(n) - 1.