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.

A218454 Smallest number m such that A176352(m) = n.

Original entry on oeis.org

1, 2, 4, 6, 8, 3, 18, 20, 11, 13, 40, 5, 64, 24, 12, 30, 395, 82, 120, 7, 22, 69, 172, 45, 14, 224, 36, 21, 23163, 9, 501, 124, 38, 325, 93, 48, 424, 389, 73, 107, 10424, 17, 588, 125, 10, 591, 39202, 143, 23, 33, 150, 71, 18422, 46, 94, 19, 203, 931, 1085
Offset: 1

Views

Author

Reinhard Zumkeller, Oct 30 2012

Keywords

Comments

A176352(a(n)) = n; if A176352 is a permutation of the natural numbers, then this sequence is its inverse.

Programs

  • Haskell
    import Data.List (elemIndex)
    import Data.Maybe (fromJust)
    a218454 = (+ 1) . fromJust . (`elemIndex` a176352_list)