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.

A265327 Smallest m such that A238324(m) = n.

Original entry on oeis.org

1, 4, 13, 2, 11, 42, 9, 40, 3, 38, 5, 36, 129, 34, 127, 32, 125, 30, 123, 28, 121, 6, 119, 8, 117, 10, 115, 12, 113, 14, 111, 16, 109, 392, 107, 390, 105, 388, 103, 386, 101, 384, 99, 382, 97, 380, 95, 378, 93, 376, 91, 374, 89, 372, 87, 370, 85, 368, 83
Offset: 1

Views

Author

Reinhard Zumkeller, Dec 07 2015

Keywords

Comments

A238324(a(n)) = n and A238324(m) != n for m < a(n).

Crossrefs

Cf. A238324.

Programs

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