A292731 Numbers in which 1 outnumbers all other digits together.

1, 11, 101, 110, 111, 112, 113, 114, 115, 116, 117, 118, 119, 121, 131, 141, 151, 161, 171, 181, 191, 211, 311, 411, 511, 611, 711, 811, 911, 1011, 1101, 1110, 1111, 1112, 1113, 1114, 1115, 1116, 1117, 1118, 1119, 1121, 1131, 1141, 1151, 1161, 1171, 1181, 1191, 1211, 1311, 1411, 1511, 1611, 1711, 1811, 1911, 2111

Offset: 1

Author

Halfdan Skjerning, Sep 22 2017

Keywords

• nonn
• base
• easy
• look

Comments

Subset of A292451.

Examples

			101 has more 1's than any other digit, whereas both 1001 and 1012 have as many other digits as 1's.
		

Links

• Robert Israel, Table of n, a(n) for n = 1..10000

Crossrefs

Cf. A292449, A292450, A292451, A292452, A292453, A292454, A292455, A292456, A292457, A292458, A292730, A292732, A292733, A292734, A292735, A292736, A292737, A292738, A292739.

Programs

Maple

g:= proc(d,m) option remember;
       local A,B,i;
         if d > m then A:= map(t -> seq(10*t+i,i=[0,$2..9]),procname(d-1,m))
         else A:= []
         fi;
         if m > 0 then B:= map(t -> 10*t+1, procname(d-1,m-1))
         else B:= []
         fi;
         [op(A),op(B)]
end proc;
g(1,0):= [$2..9]:
g(1,1):= [1]:
f:= proc(d) local m; seq(op(g(d,m)),m=ceil((d+1)/2)..d) end proc:
sort([seq(f(d),d=1..4)]); # Robert Israel, Jan 10 2019

Mathematica

Select[Range[0, 2200], Total@ #1 < First@ #2 & @@ TakeDrop[RotateLeft@ DigitCount@ #, 9] &] (* Michael De Vlieger, Sep 22 2017 *)