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.

A276930 Number of ordered set partitions of [n] with at most ten elements per block.

This page as a plain text file.
%I A276930 #8 May 24 2018 12:12:42
%S A276930 1,1,3,13,75,541,4683,47293,545835,7087261,102247563,1622632572,
%T A276930 28091567570,526858347730,10641342953670,230283190536542,
%U A276930 5315654669985946,130370766690581274,3385534653313192094,92801587015186096762,2677687786557636155446
%N A276930 Number of ordered set partitions of [n] with at most ten elements per block.
%H A276930 Alois P. Heinz, <a href="/A276930/b276930.txt">Table of n, a(n) for n = 0..424</a>
%F A276930 E.g.f.: 1/(1-Sum_{i=1..10} x^i/i!).
%p A276930 a:= proc(n) option remember; `if`(n=0, 1, add(
%p A276930        a(n-i)*binomial(n, i), i=1..min(n, 10)))
%p A276930     end:
%p A276930 seq(a(n), n=0..25);
%t A276930 max = 25; CoefficientList[1/(1-Sum[x^i/i!, {i, 1, 10}]) + O[x]^(max+1), x]* Range[0, max]! (* _Jean-François Alcover_, May 24 2018 *)
%Y A276930 Column k=10 of A276921.
%Y A276930 Cf. A229227.
%K A276930 nonn
%O A276930 0,3
%A A276930 _Alois P. Heinz_, Sep 22 2016