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.

A276929 Number of ordered set partitions of [n] with at most nine elements per block.

This page as a plain text file.
%I A276929 #10 May 24 2018 12:12:49
%S A276929 1,1,3,13,75,541,4683,47293,545835,7087261,102247562,1622632550,
%T A276929 28091567042,526858335146,10641342645362,230283182692706,
%U A276929 5315654461874042,130370760923004602,3385534486308684710,92801581965119911026,2677687627216659136794
%N A276929 Number of ordered set partitions of [n] with at most nine elements per block.
%H A276929 Alois P. Heinz, <a href="/A276929/b276929.txt">Table of n, a(n) for n = 0..424</a>
%F A276929 E.g.f.: 1/(1-Sum_{i=1..9} x^i/i!).
%p A276929 a:= proc(n) option remember; `if`(n=0, 1, add(
%p A276929        a(n-i)*binomial(n, i), i=1..min(n, 9)))
%p A276929     end:
%p A276929 seq(a(n), n=0..25);
%t A276929 max = 25; CoefficientList[1/(1-Sum[x^i/i!, {i, 1, 9}]) + O[x]^(max+1), x]* Range[0, max]! (* _Jean-François Alcover_, May 24 2018 *)
%Y A276929 Column k=9 of A276921.
%Y A276929 Cf. A229226.
%K A276929 nonn
%O A276929 0,3
%A A276929 _Alois P. Heinz_, Sep 22 2016