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 A320762 #4 Oct 20 2018 17:53:30 %S A320762 1,14,224,3696,64680,1206744,24011988,508864356,11459682234, %T A320762 273563089800,6904861371408,183819838041840,5149305370473264, %U A320762 151447801937560128,4666989813249123360,150394712706368466336,5059062167993588722968,177346570951333803395376 %N A320762 Number of ordered set partitions of [n] where the maximal block size equals six. %H A320762 Alois P. Heinz, <a href="/A320762/b320762.txt">Table of n, a(n) for n = 6..424</a> %F A320762 E.g.f.: 1/(1-Sum_{i=1..6} x^i/i!) - 1/(1-Sum_{i=1..5} x^i/i!). %F A320762 a(n) = A276926(n) - A276925(n). %p A320762 b:= proc(n, k) option remember; `if`(n=0, 1, add( %p A320762 b(n-i, k)*binomial(n, i), i=1..min(n, k))) %p A320762 end: %p A320762 a:= n-> (k-> b(n, k) -b(n, k-1))(6): %p A320762 seq(a(n), n=6..25); %Y A320762 Column k=6 of A276922. %Y A320762 Cf. A276925, A276926. %K A320762 nonn %O A320762 6,2 %A A320762 _Alois P. Heinz_, Oct 20 2018