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.

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

This page as a plain text file.
%I A276898 #7 Sep 22 2016 09:49:28
%S A276898 1,1,3,13,75,541,4683,47293,545835,6541426,82575992,1105638712,
%T A276898 15740668640,238286993344,3830996668880,65290928665336,
%U A276898 1177060804189460,22361980927148976,446348461695232608,9336784271669066016,204240575957464571232,4663193421334759826472
%N A276898 Number of ordered set partitions of [n] such that for each block b the smallest integer interval containing b has at most eight elements.
%H A276898 Alois P. Heinz, <a href="/A276898/b276898.txt">Table of n, a(n) for n = 0..448</a>
%F A276898 a(n) ~ exp(7) * n!. - _Vaclav Kotesovec_, Sep 22 2016
%Y A276898 Column k=8 of A276890.
%Y A276898 Cf. A276724.
%K A276898 nonn
%O A276898 0,3
%A A276898 _Alois P. Heinz_, Sep 21 2016