login

Reminder: The OEIS is hiring a new managing editor, and the application deadline is January 26.

Digitally fair numbers: integers n such that in all bases b = 2..10 no digit occurs more often than ceiling(d/b) times, where d is the number of digits of n in base b.
1

%I #17 Feb 17 2024 15:04:52

%S 1,2,19,198,25410896,31596420,10601629982,10753657942,11264883970,

%T 11543640378,11553029646,11665278790,12034384190,12038440382,

%U 12366849814,12519032774,12781964290,12971872086,13156400486

%N Digitally fair numbers: integers n such that in all bases b = 2..10 no digit occurs more often than ceiling(d/b) times, where d is the number of digits of n in base b.

%C Presumed infinite. Next term >= 3^20.

%H Hagen von Eitzen, <a href="/A145104/b145104.txt">Table of n, a(n) for n = 1..10000</a>

%Y Cf. A049354, A049355, A049356, A049357, A049358, A049359, A049360, A049361, A049362, A049363, A049364, A145100, A145101.

%K base,nonn

%O 1,2

%A _Reikku Kulon_, Oct 01 2008

%E More terms from _Hagen von Eitzen_, Jun 20 2009