This is a front-end for the Online Encyclopedia of Integer Sequences, made by Christian Perfect. The idea is to provide OEIS entries in non-ancient HTML, and then to think about how they're presented visually. The source code is on GitHub.
%I A262358 #20 Nov 03 2023 15:09:00
%S A262358 1,2,3,4,5,6,7,8,9,10,11,12,14,16,18,20,22,24,26,13,28,30,31,35,39,43,
%T A262358 47,51,55,15,32,38,60,61,63,65,67,69,71,17,36,42,62,77,78,80,82,84,86,
%U A262358 19,40,46,64,79,89,90,92,94,96,21,44,50,66,81,91,99,100
%N A262358 Inverse permutation to A262356.
%C A262358 A262377 and A262377 give primes and where they occur: A262377(n)=a(A262378(n)).
%H A262358 Alois P. Heinz, <a href="/A262358/b262358.txt">Table of n, a(n) for n = 1..20000</a> (2958 terms from Reinhard Zumkeller)
%H A262358 <a href="/index/Per#IntegerPermutation">Index entries for sequences that are permutations of the natural numbers</a>
%t A262358 terms = 100;
%t A262358 (* 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]]]]]];
%t A262358 Sort[Table[{b[n], n}, {n, 1, 2 terms}]][[1 ;; terms, 2]] (* _Jean-François Alcover_, Mar 12 2019 *)
%o A262358 (Haskell)
%o A262358 import Data.List (elemIndex); import Data.Maybe (fromJust)
%o A262358 a262358 = (+ 1) . fromJust . (`elemIndex` a262356_list)
%Y A262358 Cf. A262356, A262360 (fixed points), A262377 (primes), A262378.
%K A262358 nonn,look
%O A262358 1,2
%A A262358 _Reinhard Zumkeller_, Sep 19 2015