|
|
A082058
|
|
a(n) is the smallest k such that prime(k) contains the digits of k in their order.
|
|
4
|
|
|
26, 5, 1, 2, 13, 3, 18, 4, 23, 8, 26, 5, 31, 6, 35, 36, 38, 7, 42, 8, 197, 47, 48, 9, 53, 54, 56, 31, 60, 10, 63, 11, 216, 51, 69, 71, 73, 12, 76, 34, 79, 13, 82, 14, 86, 88, 89, 15, 93, 35, 96, 36, 98, 16, 100, 102, 103, 37, 107, 17, 110, 18, 257, 38, 116
(list;
graph;
refs;
listen;
history;
text;
internal format)
|
|
|
OFFSET
|
0,1
|
|
LINKS
|
|
|
FORMULA
|
|
|
EXAMPLE
|
0 appears first in 26th prime (101), so a(0) = 26;
9 appears first in 8th prime (19), so a(9) = 8;
24 appears first in 53rd prime (241), so a(24) = 53.
|
|
MATHEMATICA
|
tg=101; T=0*Range[tg]; k=0; subs[n_] := Block[{d = IntegerDigits[n]}, Flatten@ Table[ FromDigits@ Take[d, {i, j}], {j, Length[d]}, {i, j}]]; While[tg > 0, s = subs[Prime[++k]]; Do[ If[e <= 100 && T[[e+1]] == 0, T[[e+1]] = k; tg--], {e, s}]]; T (* Giovanni Resta, Apr 29 2017 *)
|
|
CROSSREFS
|
|
|
KEYWORD
|
base,nonn
|
|
AUTHOR
|
|
|
EXTENSIONS
|
|
|
STATUS
|
approved
|
|
|
|