|
Search: id:A145104
|
|
|
| A145104 |
|
Digitally fair numbers: integers n such that in all bases b [2, 10] no digit occurs more than ceil(d / b) times, where d is the number of digits in n for base b. |
|
+0
1
|
|
| 1, 2, 19, 198, 25410896, 31596420, 10601629982, 10753657942, 11264883970, 11543640378, 11553029646, 11665278790, 12034384190, 12038440382, 12366849814, 12519032774, 12781964290, 12971872086, 13156400486
(list; graph; listen)
|
|
|
OFFSET
|
1,2
|
|
|
COMMENT
|
Presumed infinite. The next term is not less than 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: A124262 A140781 A128970 this_sequence A114016 A126039 A091852
Adjacent sequences: A145101 A145102 A145103 this_sequence A145105 A145106 A145107
|
|
KEYWORD
|
base,hard,nonn
|
|
AUTHOR
|
Reikku Kulon (reikku(AT)gmail.com), Oct 01 2008
|
|
EXTENSIONS
|
More terms from Hagen von Eitzen (math(AT)von-eitzen.de), Jun 20 2009
|
|
|
Search completed in 0.002 seconds
|
