|
|
A176770
|
|
Smallest power of 11 whose decimal expansion contains n.
|
|
1
|
|
|
161051, 1, 121, 1331, 14641, 161051, 14641, 1771561, 19487171, 19487171, 161051, 11, 121, 1331, 14641, 1771561, 161051, 1771561, 9849732675807611094711841, 19487171, 672749994932560009201, 121, 34522712143931, 2357947691, 25937424601
(list;
graph;
refs;
listen;
history;
text;
internal format)
|
|
|
OFFSET
|
0,1
|
|
COMMENTS
|
|
|
LINKS
|
|
|
FORMULA
|
a(n) = MIN{A001020(i) such that n in decimal representation is a substring of A001020(i)}.
|
|
EXAMPLE
|
a(1) = 1 because 11^0 = 1 has "1" as a substring (not a proper substring, though).
a(2) = 121 because 11^2 = 121 has "2" as a substring.
a(3) = 1331 because 11^3 = 1331 has "3" as a substring.
|
|
MATHEMATICA
|
A176770[n_] := Block[{k = -1}, While[StringFreeQ[IntegerString[11^++k], IntegerString[n]]]; 11^k]; Array[A176770, 50, 0] (* Paolo Xausa, Apr 04 2024 *)
|
|
CROSSREFS
|
|
|
KEYWORD
|
base,easy,nonn
|
|
AUTHOR
|
|
|
EXTENSIONS
|
|
|
STATUS
|
approved
|
|
|
|