This site is supported by donations to The OEIS Foundation.

 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 A052268 First differences of 10^n (A011557). 49
 9, 90, 900, 9000, 90000, 900000, 9000000, 90000000, 900000000, 9000000000, 90000000000, 900000000000, 9000000000000, 90000000000000, 900000000000000, 9000000000000000 (list; graph; refs; listen; history; text; internal format)
 OFFSET 1,1 COMMENTS For n >=1, a(n) is equal to the number of functions f:{1,2...,n}->{1,2,...,10} such that for a fixed x in {1,2,...,n} and a fixed y in {1,2,...,10} we have f(x)<>y. - Aleksandar M. Janjic and Milan Janjic, Mar 27 2007 For n >= 1, a(n) is the number of n-digit positive integers. - Geoffrey Critzer, Apr 23 2009 REFERENCES A. H. Beiler, Recreations in the Theory of Numbers, Dover, N.Y., 1964, pp. 194-196. Miklos Bona, Introduction to Enumerative Combinatorics, McGraw-Hill, 2007, p. 8. LINKS Milan Janjic, Enumerative Formulas for Some Functions on Finite Sets Index entries for linear recurrences with constant coefficients, signature (10). FORMULA a(n)=9*10^(n-1), n >= 1. MATHEMATICA q = 10; Join[{a = 1}, Table[If[n == 0, a = q * a - 1, a = q * a], {n, 0, 25}]] (* Vladimir Joseph Stephan Orlovsky, Jul 11 2011 *) Differences[10^Range[0, 19]] (* Alonso del Arte, Feb 23 2015 *) PROG (PARI) a(n)=9*10^(n-1) \\ Charles R Greathouse IV, Sep 24 2015 CROSSREFS Cf. A011557. Sequence in context: A156577 A299872 A173480 * A155199 A147841 A036258 Adjacent sequences:  A052265 A052266 A052267 * A052269 A052270 A052271 KEYWORD easy,nonn AUTHOR Barry E. Williams, Feb 03 2000 EXTENSIONS Deleted erroneous term a(0)=1. - N. J. A. Sloane, Apr 02 2015 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
The OEIS Community | Maintained by The OEIS Foundation Inc.

Last modified March 26 14:18 EDT 2019. Contains 321497 sequences. (Running on oeis4.)