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.

A200087 Smallest number m such that A079878(m) = n.

Original entry on oeis.org

1, 2, 53, 5, 71, 26, 9, 8, 19, 72, 149, 27, 91, 18, 21, 17, 43, 20, 29, 50, 35, 150, 45, 28, 99, 92, 773, 34, 171, 42, 33, 32, 123, 44, 49, 41, 75227, 58, 137, 51, 295, 48, 789, 68, 47, 46, 65, 57, 891, 100, 269, 90, 111, 428, 921, 64, 131, 172, 105, 203
Offset: 1

Views

Author

Reinhard Zumkeller, Nov 13 2011

Keywords

Comments

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

Programs

  • Haskell
    import Data.List (elemIndex)
    import Data.Maybe (fromJust)
    a200087 n = (fromJust $ elemIndex n a079878_list) + 1