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.

A127812 Smallest m such that A072594(m) = n.

Original entry on oeis.org

4, 1, 2, 3, 21, 5, 15, 7, 33, 22, 66, 11, 77, 13, 39, 26, 57, 17, 51, 19, 69, 46, 95, 23, 145, 465, 155, 435, 93, 29, 87, 31, 185, 777, 259, 555, 222, 37, 111, 74, 129, 41, 123, 43, 141, 94, 215, 47, 265, 1113, 371, 795, 318, 53, 159, 106, 177, 118, 354, 59, 366, 61
Offset: 0

Views

Author

Reinhard Zumkeller, Feb 02 2007

Keywords

Comments

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

Programs

  • Haskell
    import Data.List (elemIndex)
    import Data.Maybe (fromJust)
    a127812 = (+ 1) . fromJust . (`elemIndex` a072594_list)
    -- Reinhard Zumkeller, Nov 17 2012