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.

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

This page as a plain text file.
%I A276726 #12 Dec 26 2018 15:02:29
%S A276726 1,1,2,5,15,52,203,877,4140,21147,115975,562595,2504665,10579224,
%T A276726 43453459,176472854,716369167,2927448727,12099445274,50734619570,
%U A276726 216264854789,928045216933,3986352066095,17086933963355,72987960721209,310631150855373,1317808552742134
%N A276726 Number of set partitions of [n] such that for each block b the smallest integer interval containing b has at most ten elements.
%H A276726 Alois P. Heinz, <a href="/A276726/b276726.txt">Table of n, a(n) for n = 0..512</a>
%H A276726 Pierpaolo Natalini, Paolo Emilio Ricci, <a href="https://doi.org/10.3390/axioms7040071">New Bell-Sheffer Polynomial Sets</a>, Axioms 2018, 7(4), 71.
%H A276726 Wikipedia, <a href="https://en.wikipedia.org/wiki/Partition_of_a_set">Partition of a set</a>
%Y A276726 Column k=10 of A276719.
%Y A276726 Cf. A276844, A276900.
%K A276726 nonn
%O A276726 0,3
%A A276726 _Alois P. Heinz_, Sep 16 2016