OFFSET
1,2
LINKS
Alois P. Heinz, Table of n, a(n) for n = 1..20000 (2958 terms from Reinhard Zumkeller)
MATHEMATICA
terms = 100;
(* b = A262356 *) b[1] = 1; b[n_] := b[n] = Module[{s, k}, s = Rest[ IntegerDigits[b[n-1]]] //. {(0).., d__} :> {d}; For[k = 2, True, k++, If[FreeQ[Array[b, n-1], k], If[s == {0}, Return[k], If[IntegerDigits[ k][[1 ;; Length[s]]] == s, Return[k]]]]]];
Sort[Table[{b[n], n}, {n, 1, 2 terms}]][[1 ;; terms, 2]] (* Jean-François Alcover, Mar 12 2019 *)
PROG
(Haskell)
import Data.List (elemIndex); import Data.Maybe (fromJust)
a262358 = (+ 1) . fromJust . (`elemIndex` a262356_list)
CROSSREFS
KEYWORD
nonn,look
AUTHOR
Reinhard Zumkeller, Sep 19 2015
STATUS
approved