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 A226880 #16 Sep 21 2017 11:33:50 %S A226880 1,1,3,10,47,246,1602,11481,95503,871030,8879558,58412751,473076122, %T A226880 3607903547,29782240841,241773783075,2137404383423,18482746670342, %U A226880 173563010955990,1554987178737075,15169020662626702,126731980207937625,1160565179374262951 %N A226880 Number of n-length words w over a 10-ary alphabet {a1,a2,...,a10} such that #(w,a1) >= #(w,a2) >= ... >= #(w,a10) >= 0, where #(w,x) counts the letters x in word w. %C A226880 Differs from A005651 first at n=11: a(11) = 58412751 != A005651(11) = 98329551. %H A226880 Alois P. Heinz, <a href="/A226880/b226880.txt">Table of n, a(n) for n = 0..1000</a> %p A226880 b:= proc(n, i, t) option remember; %p A226880 `if`(t=1, 1/n!, add(b(n-j, j, t-1)/j!, j=i..n/t)) %p A226880 end: %p A226880 a:= n-> n!*b(n, 0, 10): %p A226880 seq(a(n), n=0..30); %Y A226880 Column k=10 of A226873. %K A226880 nonn %O A226880 0,3 %A A226880 _Alois P. Heinz_, Jun 21 2013