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.

A276928 Number of ordered set partitions of [n] with at most eight elements per block.

This page as a plain text file.
%I A276928 #10 May 24 2018 12:12:55
%S A276928 1,1,3,13,75,541,4683,47293,545835,7087260,102247542,1622632110,
%T A276928 28091557362,526858114926,10641337416138,230283052622766,
%U A276928 5315651069181882,130370668142722722,3385531828379161890,92801502294634265418,2677685131818279016434
%N A276928 Number of ordered set partitions of [n] with at most eight elements per block.
%H A276928 Alois P. Heinz, <a href="/A276928/b276928.txt">Table of n, a(n) for n = 0..424</a>
%F A276928 E.g.f.: 1/(1-Sum_{i=1..8} x^i/i!).
%p A276928 a:= proc(n) option remember; `if`(n=0, 1, add(
%p A276928        a(n-i)*binomial(n, i), i=1..min(n, 8)))
%p A276928     end:
%p A276928 seq(a(n), n=0..25);
%t A276928 max = 25; CoefficientList[1/(1-Sum[x^i/i!, {i, 1, 8}]) + O[x]^(max+1), x]* Range[0, max]! (* _Jean-François Alcover_, May 24 2018 *)
%Y A276928 Column k=8 of A276921.
%Y A276928 Cf. A229225.
%K A276928 nonn
%O A276928 0,3
%A A276928 _Alois P. Heinz_, Sep 22 2016