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!)
 A035927 One less than number of n-multisets chosen from a 10-set. 7
 0, 9, 54, 219, 714, 2001, 5004, 11439, 24309, 48619, 92377, 167959, 293929, 497419, 817189, 1307503, 2042974, 3124549, 4686824, 6906899, 10015004, 14307149, 20160074, 28048799, 38567099, 52451255, 70607459, 94143279 (list; graph; refs; listen; history; text; internal format)
 OFFSET 0,2 COMMENTS Number of distinct n-digit numbers up to permutations of digits. - Michael Somos, Jul 11 2002 LINKS Michael Beeler, R. William Gosper and Richard C. Schroeppel, HAKMEM, ITEM 56, Cambridge, MA: Mass. Institute of Technology Artificial Intelligence Laboratory, Memo AIM-239, Feb. 1972, Item 56. Eric Weisstein's World of Mathematics, Multiplicative Persistence. Index entries for linear recurrences with constant coefficients, signature (10,-45,120,-210,252,-210,120,-45,10,-1). FORMULA G.f.: 1/(1-x)^10-1/(1-x). - Michael Somos, Jul 11 2002 MAPLE binomial(10+n-1, n)-1; MATHEMATICA Table[Binomial[10 + n - 1, n] - 1, {n, 0, 27}] (* Michael De Vlieger, Jul 14 2015 *) PROG (PARI) a(n)=if(n<0, 0, binomial(n+9, 9)-1) CROSSREFS Equals A000582 - 1. Cf. A014553, A179239. Sequence in context: A073974 A223927 A307045 * A250286 A289254 A059597 Adjacent sequences:  A035924 A035925 A035926 * A035928 A035929 A035930 KEYWORD nonn,easy AUTHOR 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 June 5 18:48 EDT 2020. Contains 334854 sequences. (Running on oeis4.)