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.

A276896 Number of ordered set partitions of [n] such that for each block b the smallest integer interval containing b has at most six elements.

This page as a plain text file.
%I A276896 #10 Jul 18 2017 08:18:13
%S A276896 1,1,3,13,75,541,4683,42610,417464,4438936,51245936,640642456,
%T A276896 8640223604,124868055888,1924066147008,31484641736040,545300469146760,
%U A276896 9967163998036554,191772882094520910,3874791064947232008,82035921068376624096,1816274191193756670912
%N A276896 Number of ordered set partitions of [n] such that for each block b the smallest integer interval containing b has at most six elements.
%H A276896 Alois P. Heinz, <a href="/A276896/b276896.txt">Table of n, a(n) for n = 0..449</a>
%F A276896 a(n) ~ exp(5) * n!. - _Vaclav Kotesovec_, Sep 22 2016
%t A276896 b[n_, m_, l_List] := b[n, m, l] = If[n == 0, m!, Sum[b[n - 1, Max[m, j], Append[ReplacePart[l, 1 -> Nothing], If[j <= m, 0, j]]], {j, Append[l, m + 1] ~Complement~ {0}}]]; a[n_] := b[n, 0, Table[0, {5}]]; Table[a[n], {n, 0, 21}] (* _Jean-François Alcover_, Jul 18 2017, after _Alois P. Heinz_ *)
%Y A276896 Column k=6 of A276890.
%Y A276896 Cf. A276722.
%K A276896 nonn
%O A276896 0,3
%A A276896 _Alois P. Heinz_, Sep 21 2016