The OEIS Foundation is supported by donations from users of the OEIS and by a grant from the Simons Foundation.

 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 A145104 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
 1, 2, 19, 198, 25410896, 31596420, 10601629982, 10753657942, 11264883970, 11543640378, 11553029646, 11665278790, 12034384190, 12038440382, 12366849814, 12519032774, 12781964290, 12971872086, 13156400486 (list; graph; refs; listen; history; text; internal format)
 OFFSET 1,2 COMMENTS Presumed infinite. Next term >= 3^20. LINKS H. v. Eitzen, Table of n, a(n) for n = 1..10000 CROSSREFS Cf. A049354, A049355, A049356, A049357, A049358, A049359, A049360, A049361, A049362, A049363, A049364, A145100, A145101. Sequence in context: A140781 A128970 A218117 * A114016 A268707 A037071 Adjacent sequences:  A145101 A145102 A145103 * A145105 A145106 A145107 KEYWORD base,hard,nonn AUTHOR Reikku Kulon, Oct 01 2008 EXTENSIONS More terms from Hagen von Eitzen, Jun 20 2009 STATUS approved

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recent
The OEIS Community | Maintained by The OEIS Foundation Inc.

Last modified September 19 18:23 EDT 2020. Contains 337181 sequences. (Running on oeis4.)