|
%I #9 Dec 20 2023 21:06:12
%S 1,2,3,11,12,15,21,22,26,38,109,119,131,149,165,168,173,212,216,235,
%T 258,264,298,313,738,745,1001,1002,1003,1022,1054,1056,1059,1156,1202,
%U 1291,1346,1378,1414,1415,1454,1484,1485,1515,1585,1609,1633,1665,1668
%N Numbers whose square has a majority of one digit and does not end in 0.
%C If 10^d < k < 10^d + 10^floor((2*d-3)/6), then k^2 has a majority of digits 0. In particular, the sequence is infinite. _Robert Israel_, Dec 20 2023
%H Robert Israel, <a href="/A060812/b060812.txt">Table of n, a(n) for n = 1..10000</a>
%e 2038^2 = 4153444 and more than half the digits are 4's.
%p filter:= proc(n) local s,t,d;
%p if n mod 10 = 0 then return false fi;
%p s:= sort(convert(n^2,base,10));
%p d:= nops(s);
%p t:= s[ceil(d/2)];
%p numboccur(t,s) > d/2;
%p end proc:
%p select(filter, [$1..2000]); # _Robert Israel_, Dec 20 2023
%K base,easy,nonn
%O 1,2
%A _Erich Friedman_, Apr 29 2001
|
