%I A035927
%S A035927 0,9,54,219,714,2001,5004,11439,24309,48619,92377,167959,293929,497419,
%T A035927 817189,1307503,2042974,3124549,4686824,6906899,10015004,14307149,
%U A035927 20160074,28048799,38567099,52451255,70607459,94143279
%N A035927 One less than number of n-multisets chosen from a 10-set.
%C A035927 Number of distinct n-digit numbers up to permutations of digits.
%D A035927 Beeler, M.; Gosper, R. W.; and Schroeppel, R. HAKMEM. Cambridge, MA: 
               Mass. Institute of Technology Artificial Intelligence Laboratory, 
               Memo AIM-239, Feb. 1972, Item 56.
%H A035927 Beeler, M., Gosper, R. W. and Schroeppel, R., <a href="http://www.inwap.com/
               pdp10/hbaker/hakmem/number.html#item56">HAKMEM, ITEM 56</a>
%H A035927 Eric Weisstein's World of Mathematics, <a href="http://mathworld.wolfram.com/
               MultiplicativePersistence.html">Link to a section of The World of 
               Mathematics.</a>
%F A035927 G.f.: 1/(1-x)^10-1/(1-x). - Additional comments from Michael Somos, Jul 
               11, 2002.
%p A035927 binomial(10+n-1,n)-1;
%o A035927 (PARI) a(n)=if(n<0,0,binomial(n+9,9)-1)
%Y A035927 Equals A000582 - 1. Cf. A014553.
%Y A035927 Sequence in context: A034719 A013567 A073974 this_sequence A059597 A023008 
               A079817
%Y A035927 Adjacent sequences: A035924 A035925 A035926 this_sequence A035928 A035929 
               A035930
%K A035927 nonn,easy
%O A035927 0,2
%A A035927 N. J. A. Sloane (njas(AT)research.att.com).
%E A035927 Additional comments from Michael Somos, Jul 11, 2002.