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.

A276925 Number of ordered set partitions of [n] with at most five elements per block.

This page as a plain text file.
%I A276925 #11 May 24 2018 12:07:10
%S A276925 1,1,3,13,75,541,4682,47278,545594,7083258,102177222,1621316466,
%T A276925 28065324210,526301293518,10628781887724,229983021824556,
%U A276925 5308071700475544,130168746864660504,3379871981604782664,92634950510491052664,2672550322299614660904
%N A276925 Number of ordered set partitions of [n] with at most five elements per block.
%H A276925 Alois P. Heinz, <a href="/A276925/b276925.txt">Table of n, a(n) for n = 0..424</a>
%F A276925 E.g.f.: 1/(1-Sum_{i=1..5} x^i/i!).
%p A276925 a:= proc(n) option remember; `if`(n=0, 1, add(
%p A276925        a(n-i)*binomial(n, i), i=1..min(n, 5)))
%p A276925     end:
%p A276925 seq(a(n), n=0..25);
%t A276925 max = 25; CoefficientList[1/(1-Sum[x^i/i!, {i, 1, 5}]) + O[x]^(max+1), x]* Range[0, max]! (* _Jean-François Alcover_, May 24 2018 *)
%Y A276925 Column k=5 of A276921.
%Y A276925 Cf. A110038.
%K A276925 nonn
%O A276925 0,3
%A A276925 _Alois P. Heinz_, Sep 22 2016