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 A293802 #4 Oct 16 2017 11:51:23 %S A293802 1,8,65,402,2457,13715,75997,405672,2160487,11323773,59410323, %T A293802 309820614,1620398321,8465984310,44406170067,233282360743, %U A293802 1230967142377,6514406116198,34634583683433,184803113451639,990647642903411,5331286355111395,28821503947539335 %N A293802 Number of multisets of nonempty words with a total of n letters over septenary alphabet containing the seventh 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 A293802 Alois P. Heinz, <a href="/A293802/b293802.txt">Table of n, a(n) for n = 7..1000</a> %F A293802 a(n) = A293737(n) - A293736(n). %Y A293802 Column k=7 of A293109. %Y A293802 Cf. A293736, A293737. %K A293802 nonn %O A293802 7,2 %A A293802 _Alois P. Heinz_, Oct 16 2017