A257173 Smallest number m such that A248737(m) = n.

0, 1, 2, 3, 69, 5, 9, 7, 40, 171, 365, 11, 805, 13, 217, 49, 637, 17, 1519, 19, 671, 125, 403, 23, 143, 2891, 1199, 1351, 917, 29, 559, 31, 799, 1099, 323, 14443, 949, 37, 803, 5027, 679, 41, 2167, 43, 1837, 6253, 341, 47, 253, 2327, 169, 4697, 2021, 53

Offset: 0

Author

Reinhard Zumkeller, Apr 17 2015

Keywords

• nonn

Comments

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

Links

• Reinhard Zumkeller, Table of n, a(n) for n = 0..90

Crossrefs

Cf. A248737.

Programs

Haskell

import Data.List (elemIndex); import Data.Maybe (fromJust)
a257173 = fromJust . (`elemIndex` a248737_list)