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 A293805 #4 Oct 16 2017 12:09:36 %S A293805 1,11,122,1003,8072,58393,415813,2822727,18990467,124845136,817467196, %T A293805 5294723066,34272624834,220905232624,1426144152942,9203001308101, %U A293805 59568878313749,386275420910370,2514732764176094,16423245577572038,107740652646320926,709605496053325546 %N A293805 Number of multisets of nonempty words with a total of n letters over denary alphabet containing the tenth 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 A293805 Alois P. Heinz, <a href="/A293805/b293805.txt">Table of n, a(n) for n = 10..1000</a> %F A293805 a(n) = A293740(n) - A293739(n). %Y A293805 Column k=10 of A293109. %Y A293805 Cf. A293739, A293740. %K A293805 nonn %O A293805 10,2 %A A293805 _Alois P. Heinz_, Oct 16 2017