|
|
A262358
|
|
Inverse permutation to A262356.
|
|
5
|
|
|
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, 47, 51, 55, 15, 32, 38, 60, 61, 63, 65, 67, 69, 71, 17, 36, 42, 62, 77, 78, 80, 82, 84, 86, 19, 40, 46, 64, 79, 89, 90, 92, 94, 96, 21, 44, 50, 66, 81, 91, 99, 100
(list;
graph;
refs;
listen;
history;
text;
internal format)
|
|
|
OFFSET
|
1,2
|
|
COMMENTS
|
|
|
LINKS
|
|
|
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]]]]]];
|
|
PROG
|
(Haskell)
import Data.List (elemIndex); import Data.Maybe (fromJust)
a262358 = (+ 1) . fromJust . (`elemIndex` a262356_list)
|
|
CROSSREFS
|
|
|
KEYWORD
|
|
|
AUTHOR
|
|
|
STATUS
|
approved
|
|
|
|