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.

A219643 Least inverse of A219642; a(n) = minimal i such that A219642(i) = n.

Original entry on oeis.org

0, 1, 2, 3, 5, 7, 8, 10, 13, 15, 18, 21, 23, 26, 29, 32, 34, 36, 39, 42, 45, 47, 50, 54, 55, 57, 60, 63, 66, 68, 71, 75, 78, 81, 84, 89, 91, 94, 97, 100, 102, 105, 109, 112, 115, 118, 123, 126, 130, 134, 138, 143, 144, 146, 149, 152, 155, 157, 160, 164, 167
Offset: 0

Views

Author

Antti Karttunen, Nov 24 2012

Keywords

Crossrefs

Cf. A219645 for the greatest inverse. A219644 gives the first differences.
This sequence is based on Fibonacci number system (Zeckendorf expansion): A014417. For analogous sequence in binary system, see: A213708, for factorial number system: A219653.