cp's OEIS Frontend

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.

A320764 Number of ordered set partitions of [n] where the maximal block size equals eight.

This page as a plain text file.
%I A320764 #4 Oct 20 2018 18:01:17
%S A320764 1,18,360,7260,152460,3361644,78041964,1908389340,49118959890,
%T A320764 1328964080730,37738620245898,1122927974067042,34953464391146730,
%U A320764 1136306352798186570,38520124906043253330,1359621561034260858906,49896547074800880656202,1901350452285623246965200
%N A320764 Number of ordered set partitions of [n] where the maximal block size equals eight.
%H A320764 Alois P. Heinz, <a href="/A320764/b320764.txt">Table of n, a(n) for n = 8..425</a>
%F A320764 E.g.f.: 1/(1-Sum_{i=1..8} x^i/i!) - 1/(1-Sum_{i=1..7} x^i/i!).
%F A320764 a(n) = A276928(n) - A276927(n).
%p A320764 b:= proc(n, k) option remember; `if`(n=0, 1, add(
%p A320764       b(n-i, k)*binomial(n, i), i=1..min(n, k)))
%p A320764     end:
%p A320764 a:= n-> (k-> b(n, k) -b(n, k-1))(8):
%p A320764 seq(a(n), n=8..25);
%Y A320764 Column k=8 of A276922.
%Y A320764 Cf. A276927, A276928.
%K A320764 nonn
%O A320764 8,2
%A A320764 _Alois P. Heinz_, Oct 20 2018