|
|
A134962
|
|
Numbers n with property that for each single digit d of n, we can also see the decimal expansion of d^2 as a substring of n. Also n may not contain any 0 digits.
|
|
10
|
|
|
1, 11, 111, 1111, 11111, 111111, 1111111, 3648169, 3649816, 3681649, 3698164, 8163649, 8164369, 8164936, 8169364, 9364816, 9368164, 9816364, 9816436, 11111111, 13648169, 13649816, 13681649, 13698164, 16364819, 16364981
(list;
graph;
refs;
listen;
history;
text;
internal format)
|
|
|
OFFSET
|
1,2
|
|
COMMENTS
|
The number of terms less than 10^k: 1, 2, 3, 4, 5, 6, 19, 410, 8083, ... . - Robert G. Wilson v, Jan 06 2012
|
|
LINKS
|
|
|
EXAMPLE
|
In 3648169, for 3 we can see 9, for 6 we can see 36, for 4 we can see 16, for 8 we can see 64, for 1 we can see 1 and for 9 we can see 81.
|
|
MATHEMATICA
|
fQ[n_] := (id = IntegerDigits@ n; Union[id][[1]] != 0 && Sort[ StringPosition[ ToString[n], ToString[#]] & /@ Evaluate[ id^2]][[1]] != {}); k = 0; lst = {}; While[k < 2*10^7, If[fQ@k, AppendTo[lst, k]; Print@ k]; k++] (* Robert G. Wilson v, Jan 06 2012 *)
|
|
PROG
|
For C++ program, see the Applegate link in A135463.
(Python)
sq = {d:str(int(d)**2) for d in "123456789"}
def ok(n): return "0" not in (s:=str(n)) and all(sq[d] in s for d in set(s))
|
|
CROSSREFS
|
|
|
KEYWORD
|
nonn,base
|
|
AUTHOR
|
|
|
EXTENSIONS
|
|
|
STATUS
|
approved
|
|
|
|