OFFSET
0,3
COMMENTS
Question: Formula for a(n)?
Note that, almost always, if the number of digits in a(0) through a(n) is a multiple of 10, a(n+1) = a(n) + 1. (The only exceptions would be if a(n) + 1 had some digit two more times than some other digit.) - Franklin T. Adams-Watters, Jan 11 2006
LINKS
Robert Israel, Table of n, a(n) for n = 0..91
EXAMPLE
After 10 the next term is 23 and not 11. Any number containing 0 or 1 would occur only after all the digits from 2 to 9 have occurred once.
MAPLE
counts:= Array(0..9):
cp:= Array(0..9):
counts[0]:= 1:
A[0]:= 0:
for n from 1 to 70 do
for x from A[n-1]+1 do
L:= convert(x, base, 10);
ArrayTools:-Copy(counts, cp);
for t in L do cp[t]:= cp[t]+1 od:
if max(cp) - min(cp) <= 1 then
A[n]:= x;
ArrayTools:-Copy(cp, counts);
break
fi
od
od:
seq(A[i], i=0..70); # Robert Israel, Sep 03 2015
CROSSREFS
KEYWORD
base,nonn
AUTHOR
Amarnath Murthy, Jun 06 2004
EXTENSIONS
Edited, corrected and extended by Franklin T. Adams-Watters, Jan 11 2006
STATUS
approved