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.

A257456 Smallest m, such that A257340(m) = n.

Original entry on oeis.org

1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 13, 12, 16, 15, 18, 14, 20, 17, 24, 23, 22, 19, 28, 21, 26, 25, 33, 27, 40, 29, 31, 35, 36, 30, 42, 32, 44, 37, 38, 34, 50, 39, 46, 45, 48, 41, 52, 43, 54, 47, 57, 49, 61, 51, 64, 55, 59, 53, 68, 56, 66, 58, 70, 60, 72, 62
Offset: 1

Views

Author

Reinhard Zumkeller, Apr 24 2015

Keywords

Comments

A257340(a(n)) = n.

Crossrefs

Cf. A257340.

Programs

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