OFFSET
1,2
COMMENTS
Here 'almost equally many' means that the most common digit appears only once more than the least common.
LINKS
Lars Blomberg, Table of n, a(n) for n = 1..4000
EXAMPLE
The first 10 multiples of 109 are 109, 218, 327, 436, 545, 654, 763, 872, 981, 1090. Every digit appears 3 times except for '1' which appears 4 times. It is clear that all numbers of the form 10909..0909 and 90909..0909 appear in the list, and it seems likely that these are the only members.
PROG
(Python)
def f(n):
""" This returns True iff n is in the sequence """
l = [ n * i for i in range(1, 11) ]
s = "".join(str(i) for i in l)
c = [ s.count(str(j)) for j in range(10) ]
return min(c) >= max(c) - 1
for n in range(1, 10000000):
if f(n):
print(n, end=', ')
CROSSREFS
KEYWORD
nonn,easy,base
AUTHOR
Jack W Grahl, Jan 20 2016
EXTENSIONS
a(7)-a(28) from Lars Blomberg, Aug 11 2016
STATUS
approved