The OEIS Foundation is supported by donations from users of the OEIS and by a grant from the Simons Foundation.

 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 A257173 Smallest number m such that A248737(m) = n. 2
 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 (list; graph; refs; listen; history; text; internal format)
 OFFSET 0,3 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 PROG (Haskell) import Data.List (elemIndex); import Data.Maybe (fromJust) a257173 = fromJust . (`elemIndex` a248737_list) CROSSREFS Cf. A248737. Sequence in context: A041249 A184949 A132598 * A232618 A115892 A290329 Adjacent sequences:  A257170 A257171 A257172 * A257174 A257175 A257176 KEYWORD nonn AUTHOR Reinhard Zumkeller, Apr 17 2015 STATUS approved

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recent
The OEIS Community | Maintained by The OEIS Foundation Inc.

Last modified August 3 13:59 EDT 2021. Contains 346438 sequences. (Running on oeis4.)