login
This site is supported by donations to The OEIS Foundation.

 

Logo

Annual appeal: Please make a donation to keep the OEIS running! Over 6000 articles have referenced us, often saying "we discovered this result with the help of the OEIS".
Other ways to donate

Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
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

Table of n, a(n) for n=0..18.

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

For n>=1, a(n)=A011557-A008591

Sequence in context: A083386 A282159 A263812 * A093282 A085439 A282155

Adjacent sequences:  A160151 A160152 A160153 * A160155 A160156 A160157

KEYWORD

nonn

AUTHOR

Geoffrey Critzer, May 03 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 | More pages
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy .

Last modified December 11 12:05 EST 2017. Contains 295876 sequences.