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 A320206 #8 Oct 07 2018 14:44:04 %S A320206 501,9945,121710,1185360,10096795,78808600,578849355,4067705855, %T A320206 27649153955,183168119565,1189058740200,7593928600995,47855567247145, %U A320206 298255270385350,1841612720379730,11281413505991390,68637389125392080,415119249476398580,2497526622600665470 %N A320206 Number of sets of nonempty words with a total of n letters over quinary alphabet such that all letters occur at least once in the set. %H A320206 Alois P. Heinz, <a href="/A320206/b320206.txt">Table of n, a(n) for n = 5..1000</a> %p A320206 h:= proc(n, i, k) option remember; `if`(n=0, 1, `if`(i<1, 0, %p A320206 add(h(n-i*j, i-1, k)*binomial(k^i, j), j=0..n/i))) %p A320206 end: %p A320206 a:= n-> (k-> add((-1)^i*binomial(k, i)*h(n$2, k-i), i=0..k))(5): %p A320206 seq(a(n), n=5..25); %Y A320206 Column k=5 of A319501. %Y A320206 Cf. A320215. %K A320206 nonn %O A320206 5,1 %A A320206 _Alois P. Heinz_, Oct 07 2018