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!)
 A182472 Smallest m such that A182458(m) = n. 2
 3, 0, 1, 7, 9, 13, 14, 8, 17, 10, 21, 46, 542, 23, 74, 22, 1362, 35, 32, 20, 3010, 81, 33, 34, 243, 30, 41, 29, 117, 38, 58, 56, 36, 874, 45, 449, 431, 40, 151, 42, 79, 73, 82, 84, 386, 52, 47, 106, 1622, 68, 75, 794, 129, 83, 61, 63, 64, 2620, 228, 103 (list; graph; refs; listen; history; text; internal format)
 OFFSET 0,1 COMMENTS A182458(a(n)) = n and A182458(m) <> n for m < a(n). LINKS Reinhard Zumkeller, Table of n, a(n) for n = 0..1000 PROG (Haskell) import Data.List (elemIndex) import Data.Maybe (fromJust) a182472 = fromJust . (`elemIndex` a182458_list) CROSSREFS Sequence in context: A248722 A201663 A199606 * A285867 A261764 A216806 Adjacent sequences:  A182469 A182470 A182471 * A182473 A182474 A182475 KEYWORD nonn,look AUTHOR Reinhard Zumkeller, Apr 30 2012 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 November 28 13:47 EST 2021. Contains 349413 sequences. (Running on oeis4.)