%I #11 Sep 07 2019 08:24:41
%S 1,4,9,11,12,13,14,19,21,29,31,34,35,36,37,38,39,41,42,43,44,46,54,56,
%T 59,61,69,72,79,81,89,91,96,106,107,108,109,111,112,113,114,115,116,
%U 117,118,119,121,122,123,124,125,126,127,128,129,131,132,133,134
%N Numbers k such that 1 is the smallest decimal digit of k^2.
%H Harvey P. Dale, <a href="/A291626/b291626.txt">Table of n, a(n) for n = 1..1000</a>
%e 29 is in the sequence because 29^2 = 841, the smallest decimal digit of which is 1.
%t Select[Range[200],Min[IntegerDigits[#^2]]==1&] (* _Harvey P. Dale_, Sep 07 2019 *)
%o (PARI) select(k->vecmin(digits(k^2))==1, vector(1000, k, k))
%o (Python)
%o A291626_list = [k for k in range(1,10**6) if min(str(k**2)) == '1'] # _Chai Wah Wu_, Aug 28 2017
%Y Cf. A291625, A291627, A291628, A291629, A291630, A291631.
%K nonn,base
%O 1,2
%A _Colin Barker_, Aug 28 2017