login

Year-end appeal: Please make a donation to the OEIS Foundation to support ongoing development and maintenance of the OEIS. We are now in our 61st year, we have over 378,000 sequences, and we’ve reached 11,000 citations (which often say “discovered thanks to the OEIS”).

A241218
Smallest number m such that A240808(m) = n.
3
2, 1, 0, 5, 10, 9, 14, 19, 15, 20, 28, 24, 23, 34, 27, 41, 37, 33, 44, 40, 36, 47, 61, 45, 53, 67, 48, 56, 70, 54, 62, 73, 57, 68, 94, 78, 71, 97, 81, 74, 100, 87, 77, 106, 90, 80, 109, 93, 86, 115, 96, 89, 121, 99, 146, 124, 105, 152, 127, 108, 155, 130
OFFSET
0,1
COMMENTS
A240808(a(n)) = n and A240808(m) <> n for m < a(n).
LINKS
PROG
(Haskell)
import Data.List (elemIndex); import Data.Maybe (fromJust)
a241218 = fromJust . (`elemIndex` a240808_list)
CROSSREFS
Cf. A120511.
Sequence in context: A331955 A185209 A316659 * A266904 A299198 A137477
KEYWORD
nonn
AUTHOR
Reinhard Zumkeller, Apr 17 2014
STATUS
approved