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.

A199262 Smallest m such that A199238(m) = n.

Original entry on oeis.org

1, 3, 11, 15, 59, 95, 223, 255, 1007, 1919, 4091, 6143, 16379, 28671, 61439, 65535, 261119, 516095, 1048571, 1966079, 4128767, 8380415, 16769023, 25165823, 67108799, 134184959, 268434431, 469762047, 1073741819, 2013265919, 4160749567, 4294967295, 17163091967
Offset: 0

Views

Author

Reinhard Zumkeller, Nov 04 2011

Keywords

Comments

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

Crossrefs

Cf. A138791.

Programs

  • Haskell
    a199262 n = (fromJust $ elemIndex n a199238_list) + 1

Extensions

a(24)-a(32) from Donovan Johnson, Nov 05 2011