[go: up one dir, main page]

login
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
OFFSET
1,2
COMMENTS
A226390(a(n)) = n and A226390(m) < n for m < a(n).
LINKS
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: A308987 A107992 A139480 * A152749 A081115 A053417
KEYWORD
nonn
AUTHOR
Reinhard Zumkeller, Jul 10 2013
STATUS
approved