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.

A208852 Smallest m such that A090895(m) = n.

Original entry on oeis.org

1, 7, 2, 6, 10, 3, 48, 5, 21, 9, 44, 81, 27, 47, 55, 11, 16, 20, 1058, 364, 745, 43, 300, 80, 69, 26, 24, 46, 5901, 54, 22, 59, 32, 17, 30, 19, 568076, 1057, 75, 363, 28, 744, 87, 42, 169, 299, 40, 79, 315, 68, 186, 25, 101, 23, 38, 45, 2924, 5900, 413, 53
Offset: 1

Views

Author

Reinhard Zumkeller, Mar 02 2012

Keywords

Comments

A090895(a(n)) = n and A090895(m) <> n for m < a(n).

Programs

  • Haskell
    import Data.List (elemIndex)
    import Data.Maybe (fromJust)
    a208852 = (+ 1) . fromJust . (`elemIndex` a090895_list)