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”).

A258354
Smallest m such that A212306(m) = n.
2
1, 3, 6, 7, 10, 16, 34, 23, 32, 160, 18, 159, 30, 63, 370, 458, 42, 60, 81, 79, 101, 94, 123, 100, 1528, 215, 494, 522, 1037, 147, 1363, 697, 178, 302, 276, 1336, 212, 804, 186, 226, 267, 815, 117, 125, 170, 216, 312, 883, 906, 360, 206, 258, 311, 354, 337
OFFSET
1,2
COMMENTS
A212306(a(n)) = n and A212306(m) != n for m < a(n).
LINKS
PROG
(Haskell)
import Data.List (elemIndex); import Data.Maybe (fromJust)
a258354 = (+ 1) . fromJust . (`elemIndex` a212306_list)
CROSSREFS
Cf. A212306.
Sequence in context: A255508 A262972 A115127 * A164557 A292608 A028754
KEYWORD
nonn
AUTHOR
Reinhard Zumkeller, May 27 2015
STATUS
approved