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.

A241218 Smallest number m such that A240808(m) = n.

Original entry on oeis.org

2, 1, 0, 5, 10, 9, 14, 19, 15, 20, 28, 24, 23, 34, 27, 41, 37, 33, 44, 40, 36, 47, 61, 45, 53, 67, 48, 56, 70, 54, 62, 73, 57, 68, 94, 78, 71, 97, 81, 74, 100, 87, 77, 106, 90, 80, 109, 93, 86, 115, 96, 89, 121, 99, 146, 124, 105, 152, 127, 108, 155, 130
Offset: 0

Views

Author

Reinhard Zumkeller, Apr 17 2014

Keywords

Comments

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

Crossrefs

Cf. A120511.

Programs

  • Haskell
    import Data.List (elemIndex); import Data.Maybe (fromJust)
    a241218 = fromJust . (`elemIndex` a240808_list)