|
|
A046829
|
|
Numbers k such that digits of k^2 include digits of k as subsequence.
|
|
7
|
|
|
0, 1, 5, 6, 10, 11, 25, 50, 60, 76, 95, 96, 100, 101, 105, 110, 125, 205, 250, 305, 371, 376, 405, 441, 500, 501, 505, 506, 525, 600, 601, 605, 625, 676, 705, 756, 760, 805, 825, 826, 905, 946, 950, 960, 976, 995, 996, 1000, 1001, 1005, 1006, 1010, 1011
(list;
graph;
refs;
listen;
history;
text;
internal format)
|
|
|
OFFSET
|
1,3
|
|
LINKS
|
|
|
MATHEMATICA
|
fQ[n_]:=LongestCommonSequence[ToString[n^2], ToString[n]]==ToString[n];
|
|
PROG
|
(Python)
from itertools import count, islice
def A046829_gen(startvalue=0): # generator of terms >= startvalue
for k in count(max(startvalue, 0)):
c = iter(str(k**2))
if all(map(lambda b:any(map(lambda a:a==b, c)), str(k))):
yield k
|
|
CROSSREFS
|
|
|
KEYWORD
|
nonn,base
|
|
AUTHOR
|
|
|
EXTENSIONS
|
|
|
STATUS
|
approved
|
|
|
|