The OEIS Foundation is supported by donations from users of the OEIS and by a grant from the Simons Foundation.

 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 A173113 a(n) = binomial(n + 10, 10) * 5^n. 1
 1, 55, 1650, 35750, 625625, 9384375, 125125000, 1519375000, 17092968750, 180425781250, 1804257812500, 17222460937500, 157872558593750, 1396564941406250, 11970556640625000, 99754638671875000 (list; graph; refs; listen; history; text; internal format)
 OFFSET 0,2 COMMENTS With a different offset, number of n-permutations (n>=10) of 6 objects: t, u, v, z, x, y with repetition allowed, containing exactly ten (10) u's. LINKS Vincenzo Librandi, Table of n, a(n) for n = 0..400 FORMULA a(n) = C(n + 10, 10)*5^n, n>=0 . G.f.; 1/(1-5*x)^11. - Vincenzo Librandi, Oct 15 2011 MATHEMATICA Table[Binomial[n + 10, 10]*5^n, {n, 0, 20}] PROG (MAGMA) [5^n*Binomial(n+10, 10): n in [0..30]]; // Vincenzo Librandi, Oct 15 2011 CROSSREFS Cf. A053464, A084902, A081143, A036071, A050982, A140405, A140220, A140346, A140520. Sequence in context: A271796 A222836 A017718 * A166844 A077688 A188712 Adjacent sequences:  A173110 A173111 A173112 * A173114 A173115 A173116 KEYWORD nonn,easy AUTHOR Zerinvary Lajos, Feb 10 2010 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 October 27 19:59 EDT 2020. Contains 338036 sequences. (Running on oeis4.)