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.

A202014 Smallest m such that A063882(m) = n.

Original entry on oeis.org

1, 5, 6, 7, 8, 10, 12, 13, 15, 17, 18, 21, 23, 24, 26, 28, 29, 32, 34, 35, 37, 39, 42, 44, 45, 47, 49, 51, 52, 55, 57, 58, 60, 62, 65, 67, 68, 70, 72, 74, 75, 78, 80, 82, 85, 87, 88, 90, 92, 94, 95, 98, 100, 102, 103, 105, 107, 109, 112, 114, 115, 117, 119
Offset: 1

Views

Author

Reinhard Zumkeller, Dec 08 2011

Keywords

Comments

A063882(a(n)) = n and A063882(m) < n for m < a(n).

Programs

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