|
|
A160154
|
|
10^n-9n for n>=1
|
|
0
|
|
|
0, 1, 82, 973, 9964, 99955, 999946, 9999937, 99999928, 999999919, 9999999910, 99999999901, 999999999892, 9999999999883, 99999999999874, 999999999999865, 9999999999999856, 99999999999999847, 999999999999999838
(list;
graph;
refs;
listen;
history;
text;
internal format)
|
|
|
OFFSET
|
0,3
|
|
COMMENTS
|
a(n) is the number of positive integers less than or equal to 10^n that have at least two distinct digits.
|
|
REFERENCES
|
Miklos Bona, Introduction to Enumerative Combinatorics, McGraw-Hill,2007,p.5
|
|
LINKS
|
|
|
FORMULA
|
O.g.f.: (x+70x^2+10x^3)/((1-x)^2*(1-10x)) E.g.f.: exp(10x)-9x*exp(x)-1
|
|
MATHEMATICA
|
CoefficientList[Series[Exp[10 x] - 9 x*Exp[x] - 1, {x, 0, 20}], x]* Table[n!, {n, 0, 20}]
|
|
CROSSREFS
|
|
|
KEYWORD
|
nonn
|
|
AUTHOR
|
|
|
STATUS
|
approved
|
|
|
|