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 A293111 #8 Oct 16 2017 10:51:43 %S A293111 1,2,10,58,439,3767,37481,405672,4816390,60748286,817467196, %T A293111 11533898929,170979909037,2635984019533,42297026556483, %U A293111 701880878089205,12045976560853148,212911592290588547,3874514946593004395,72378921228197309169,1387364840045160600103 %N A293111 Number of multisets of nonempty words with a total of 2n letters over n-ary alphabet containing the n-th letter such that within each prefix of a word every letter of the alphabet is at least as frequent as the subsequent alphabet letter. %H A293111 Alois P. Heinz, <a href="/A293111/b293111.txt">Table of n, a(n) for n = 0..26</a> %F A293111 a(n) = A293109(2n,n). %Y A293111 Cf. A182172, A293109, A293115. %K A293111 nonn %O A293111 0,2 %A A293111 _Alois P. Heinz_, Sep 30 2017