This site is supported by donations to The OEIS Foundation.

 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 A227388 Smallest m such that A226390(m) = n. 3
 1, 2, 4, 10, 14, 24, 30, 36, 42, 48, 54, 72, 80, 88, 96, 120, 130, 140, 150, 160, 170, 180, 190, 200, 210, 246, 258, 270, 282, 294, 306, 350, 364, 378, 392, 406, 420, 472, 488, 504, 520, 536, 552, 612, 630, 648, 666, 684, 702, 770, 790, 810, 830, 850, 870 (list; graph; refs; listen; history; text; internal format)
 OFFSET 1,2 COMMENTS A226390(a(n)) = n and A226390(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) a227388 = (+ 1) . fromJust . (`elemIndex` a226390_list) CROSSREFS Cf. A227389 (first differences); A014011. Sequence in context: A057283 A107992 A139480 * A152749 A081115 A053417 Adjacent sequences:  A227385 A227386 A227387 * A227389 A227390 A227391 KEYWORD nonn AUTHOR Reinhard Zumkeller, Jul 10 2013 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 July 21 06:50 EDT 2019. Contains 325191 sequences. (Running on oeis4.)