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.

A257078 Smallest number m such that A248756(m) = n.

Original entry on oeis.org

1, 4, 3, 11, 18, 13, 7, 23, 39, 42, 64, 27, 43, 29, 15, 47, 78, 141, 142, 212, 278, 83, 241, 55, 86, 149, 150, 59, 90, 61, 31, 95, 158, 285, 286, 541, 542, 1051, 796, 931, 483, 167, 485, 295, 422, 171, 489, 111, 174, 301, 302, 557, 558, 179, 497, 119, 182
Offset: 1

Views

Author

Reinhard Zumkeller, Apr 15 2015

Keywords

Comments

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

Crossrefs

Cf. A248756.

Programs

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