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.

A258765 Smallest m such that |A258057(m)| = n.

Original entry on oeis.org

0, 1, 98, 3, 5, 25, 8, 34, 13, 44, 325, 7, 22, 86, 20, 11, 74, 1910, 62, 122, 17, 4563, 254, 19, 15, 50, 117, 7174, 385, 177, 29, 16, 61, 69, 24, 213, 51, 118, 73, 56601, 41, 121, 82, 23, 866, 9025, 68, 43, 35, 142, 135, 5005, 39, 77, 106, 52, 174, 5865, 70
Offset: 0

Views

Author

Reinhard Zumkeller, Jun 10 2015

Keywords

Comments

|A258057(a(n))| = n and |A258057(m)| != n for m < a(n).

Crossrefs

Programs

  • Haskell
    import Data.List (elemIndex); import Data.Maybe (fromJust)
    a258765 = fromJust . (`elemIndex` (map abs a258057_list))