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.

A287256 Number of set partitions of [n] such that all absolute differences between least elements of consecutive blocks are <= six.

This page as a plain text file.
%I A287256 #6 May 22 2017 11:53:40
%S A287256 1,1,2,5,15,52,203,877,4139,21079,114784,664100,4062241,26164323,
%T A287256 176828713,1250185783,9221588229,70796614497,564525137134,
%U A287256 4666694339977,39927027760582,353023213637306,3221255985418911,30296436876469140,293363448567612910
%N A287256 Number of set partitions of [n] such that all absolute differences between least elements of consecutive blocks are <= six.
%H A287256 Alois P. Heinz, <a href="/A287256/b287256.txt">Table of n, a(n) for n = 0..581</a>
%H A287256 Wikipedia, <a href="https://en.wikipedia.org/wiki/Partition_of_a_set">Partition of a set</a>
%F A287256 a(n) = A287216(n,6).
%F A287256 a(n) = A000110(n) for n <= 7.
%Y A287256 Column k=6 of A287216.
%Y A287256 Cf. A000110.
%K A287256 nonn
%O A287256 0,3
%A A287256 _Alois P. Heinz_, May 22 2017