cp's OEIS Frontend

A292731 Numbers in which 1 outnumbers all other digits together.

%I A292731 #19 Jan 10 2019 22:52:56
%S A292731 1,11,101,110,111,112,113,114,115,116,117,118,119,121,131,141,151,161,
%T A292731 171,181,191,211,311,411,511,611,711,811,911,1011,1101,1110,1111,1112,
%U A292731 1113,1114,1115,1116,1117,1118,1119,1121,1131,1141,1151,1161,1171,1181,1191,1211,1311,1411,1511,1611,1711,1811,1911,2111
%N A292731 Numbers in which 1 outnumbers all other digits together.
%C A292731 Subset of A292451.
%H A292731 Robert Israel, <a href="/A292731/b292731.txt">Table of n, a(n) for n = 1..10000</a>
%e A292731 101 has more 1's than any other digit, whereas both 1001 and 1012 have as many other digits as 1's.
%p A292731 g:= proc(d,m) option remember;
%p A292731        local A,B,i;
%p A292731          if d > m then A:= map(t -> seq(10*t+i,i=[0,$2..9]),procname(d-1,m))
%p A292731          else A:= []
%p A292731          fi;
%p A292731          if m > 0 then B:= map(t -> 10*t+1, procname(d-1,m-1))
%p A292731          else B:= []
%p A292731          fi;
%p A292731          [op(A),op(B)]
%p A292731 end proc;
%p A292731 g(1,0):= [$2..9]:
%p A292731 g(1,1):= [1]:
%p A292731 f:= proc(d) local m; seq(op(g(d,m)),m=ceil((d+1)/2)..d) end proc:
%p A292731 sort([seq(f(d),d=1..4)]); # _Robert Israel_, Jan 10 2019
%t A292731 Select[Range[0, 2200], Total@ #1 < First@ #2 & @@ TakeDrop[RotateLeft@ DigitCount@ #, 9] &] (* _Michael De Vlieger_, Sep 22 2017 *)
%Y A292731 Cf. A292449, A292450, A292451, A292452, A292453, A292454, A292455, A292456, A292457, A292458, A292730, A292732, A292733, A292734, A292735, A292736, A292737, A292738, A292739.
%K A292731 nonn,base,easy,look
%O A292731 1,2
%A A292731 _Halfdan Skjerning_, Sep 22 2017