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.

A241752 Smallest number m such that A229037(m) = n.

Original entry on oeis.org

1, 3, 95, 8, 22, 121, 144, 24, 27, 60, 67, 73, 66, 79, 163, 196, 148, 150, 220, 80, 181, 173, 178, 197, 213, 203, 194, 202, 261, 374, 304, 387, 645, 295, 447, 379, 290, 420, 362, 506, 515, 878, 520, 836, 941, 495, 594, 754, 884, 958, 501, 485, 561, 407, 467
Offset: 1

Views

Author

Reinhard Zumkeller, Apr 28 2014

Keywords

Comments

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

Programs

  • Haskell
    import Data.List (elemIndex); import Data.Maybe (fromJust)
    a241752 = (+ 1) . fromJust . (`elemIndex` a229037_list)