The OEIS is supported by the many generous donors to the OEIS Foundation.

 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 A265327 Smallest m such that A238324(m) = n. 2
 1, 4, 13, 2, 11, 42, 9, 40, 3, 38, 5, 36, 129, 34, 127, 32, 125, 30, 123, 28, 121, 6, 119, 8, 117, 10, 115, 12, 113, 14, 111, 16, 109, 392, 107, 390, 105, 388, 103, 386, 101, 384, 99, 382, 97, 380, 95, 378, 93, 376, 91, 374, 89, 372, 87, 370, 85, 368, 83 (list; graph; refs; listen; history; text; internal format)
 OFFSET 1,2 COMMENTS A238324(a(n)) = n and A238324(m) != n for m < a(n). LINKS Reinhard Zumkeller, Table of n, a(n) for n = 1..10000 PROG (Haskell) import Data.List (elemIndex); import Data.Maybe (fromJust) a265327 = (+ 1) . fromJust . (`elemIndex` a238324_list) CROSSREFS Cf. A238324. Sequence in context: A130539 A156823 A212256 * A130650 A170865 A320030 Adjacent sequences: A265324 A265325 A265326 * A265328 A265329 A265330 KEYWORD nonn AUTHOR Reinhard Zumkeller, Dec 07 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 | Recents
The OEIS Community | Maintained by The OEIS Foundation Inc.

Last modified February 29 13:45 EST 2024. Contains 370425 sequences. (Running on oeis4.)