This is a front-end for the Online Encyclopedia of Integer Sequences, made by Christian Perfect. The idea is to provide OEIS entries in non-ancient HTML, and then to think about how they're presented visually. The source code is on GitHub.
%I A035927 #31 Feb 16 2025 08:32:37
%S A035927 0,9,54,219,714,2001,5004,11439,24309,48619,92377,167959,293929,
%T A035927 497419,817189,1307503,2042974,3124549,4686824,6906899,10015004,
%U A035927 14307149,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. - _Michael Somos_, Jul 11 2002
%C A035927 Equivalently, for n > 0, a(n) = number of n-digit decimal numbers d_1 d_2 ... d_n with d_1 > 0 and d_1 >= d_2 >= ... >= d_n >= 0.. - _N. J. A. Sloane_, Jul 13 2023
%H A035927 Michael Beeler, R. William Gosper and Richard C. Schroeppel, <a href="http://www.inwap.com/pdp10/hbaker/hakmem/number.html#item56">HAKMEM, ITEM 56</a>, Cambridge, MA: Mass. Institute of Technology Artificial Intelligence Laboratory, Memo AIM-239, Feb. 1972, Item 56.
%H A035927 Eric Weisstein's World of Mathematics, <a href="https://mathworld.wolfram.com/MultiplicativePersistence.html">Multiplicative Persistence.</a>
%H A035927 <a href="/index/Rec#order_10">Index entries for linear recurrences with constant coefficients</a>, signature (10,-45,120,-210,252,-210,120,-45,10,-1).
%F A035927 G.f.: 1/(1-x)^10-1/(1-x). - _Michael Somos_, Jul 11 2002
%p A035927 binomial(10+n-1,n)-1;
%t A035927 Table[Binomial[9 + n, n] - 1, {n, 0, 27}] (* _Michael De Vlieger_, Jul 14 2015 *)
%t A035927 CoefficientList[Series[1/(1-x)^10-1/(1-x),{x,0,30}],x] (* or *) LinearRecurrence[{10,-45,120,-210,252,-210,120,-45,10,-1},{0,9,54,219,714,2001,5004,11439,24309,48619},30] (* _Harvey P. Dale_, Jul 11 2023 *)
%o A035927 (PARI) a(n)=if(n<0,0,binomial(n+9,9)-1)
%Y A035927 Equals A000582 - 1. Cf. A014553, A179239.
%K A035927 nonn,easy
%O A035927 0,2
%A A035927 _N. J. A. Sloane_