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 A293801 #4 Oct 16 2017 11:46:32 %S A293801 1,7,50,275,1500,7517,37481,180552,868974,4120598,19574576,92438492, %T A293801 437977946,2072100450,9843499790,46801485700,223513049582, %U A293801 1069698339831,5142776951972,24793644707917,120072824665722,583316549714731,2846266161931683,13933753316683787 %N A293801 Number of multisets of nonempty words with a total of n letters over senary alphabet containing the sixth 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 A293801 Alois P. Heinz, <a href="/A293801/b293801.txt">Table of n, a(n) for n = 6..1000</a> %F A293801 a(n) = A293736(n) - A293735(n). %Y A293801 Column k=6 of A293109. %Y A293801 Cf. A293735, A293736. %K A293801 nonn %O A293801 6,2 %A A293801 _Alois P. Heinz_, Oct 16 2017