cp's OEIS Frontend

A029772 Every digit that appears in k also appears at least once in k^2.

%I A029772 #21 Apr 04 2023 19:16:07
%S A029772 0,1,5,6,10,11,25,27,50,55,60,63,64,66,74,76,95,96,99,100,101,105,110,
%T A029772 111,112,115,116,125,139,142,199,205,211,222,225,232,250,255,261,270,
%U A029772 275,277,278,285,288,305,323,363,364,366,371,376,405,421
%N A029772 Every digit that appears in k also appears at least once in k^2.
%H A029772 Zak Seidov, <a href="/A029772/b029772.txt">Table of n, a(n) for n = 1..1000</a>
%e A029772 55 is in the list because 55^2 = 3025 and 5 appears in 3025.
%e A029772 323 is in the list because 323^2 = 104329 and 2, 3 appear in 104329.
%t A029772 d[n_]:=IntegerDigits[n]; Select[Range[0,421],Complement[d[#],d[#^2]]=={}&] (* _Jayanta Basu_, Jun 02 2013 *)
%o A029772 (Magma) [n: n in [0..500] | Intseq(n) subset Intseq(n^2)]; // _Bruno Berselli_, Aug 01 2013
%o A029772 (Python)
%o A029772 from itertools import count, islice
%o A029772 def A029772_gen(startvalue=0): # generator of terms >= startvalue
%o A029772     return filter(lambda n:set(str(n)) <= set(str(n**2)), count(max(startvalue,0)))
%o A029772 A029772_list = list(islice(A029772_gen(),20)) # _Chai Wah Wu_, Apr 03 2023
%Y A029772 See A046827, where it is required that the digits of n appear in n^2 at least as often as they appear in n.
%K A029772 nonn,base
%O A029772 1,3
%A A029772 _Patrick De Geest_