This site is supported by donations to The OEIS Foundation.

Thanks to everyone who made a donation during our annual appeal!
To see the list of donors, or make a donation, see the OEIS Foundation home page.

 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 A241752 Smallest number m such that A229037(m) = n. 7
 1, 3, 95, 8, 22, 121, 144, 24, 27, 60, 67, 73, 66, 79, 163, 196, 148, 150, 220, 80, 181, 173, 178, 197, 213, 203, 194, 202, 261, 374, 304, 387, 645, 295, 447, 379, 290, 420, 362, 506, 515, 878, 520, 836, 941, 495, 594, 754, 884, 958, 501, 485, 561, 407, 467 (list; graph; refs; listen; history; text; internal format)
 OFFSET 1,2 COMMENTS A229037(a(n)) = n and A229037(m) <> n for m < a(n). LINKS Reinhard Zumkeller, Table of n, a(n) for n = 1..1000 PROG (Haskell) import Data.List (elemIndex); import Data.Maybe (fromJust) a241752 = (+ 1) . fromJust . (`elemIndex` a229037_list) CROSSREFS Sequence in context: A037113 A142887 A297489 * A093009 A273442 A322460 Adjacent sequences:  A241749 A241750 A241751 * A241753 A241754 A241755 KEYWORD nonn AUTHOR Reinhard Zumkeller, Apr 28 2014 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 January 16 15:53 EST 2019. Contains 319195 sequences. (Running on oeis4.)