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.

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

This page as a plain text file.
%I A287259 #6 May 22 2017 11:55:10
%S A287259 1,1,2,5,15,52,203,877,4140,21147,115975,678569,4213081,27621156,
%T A287259 190402182,1375129039,10374133545,81541494757,666269176903,
%U A287259 5648127595636,49587725282894,450158439775999,4219372853286578,40779812327165914,405907919759151220
%N A287259 Number of set partitions of [n] such that all absolute differences between least elements of consecutive blocks are <= nine.
%H A287259 Alois P. Heinz, <a href="/A287259/b287259.txt">Table of n, a(n) for n = 0..579</a>
%H A287259 Wikipedia, <a href="https://en.wikipedia.org/wiki/Partition_of_a_set">Partition of a set</a>
%F A287259 a(n) = A287216(n,9).
%F A287259 a(n) = A000110(n) for n <= 10.
%Y A287259 Column k=9 of A287216.
%Y A287259 Cf. A000110.
%K A287259 nonn
%O A287259 0,3
%A A287259 _Alois P. Heinz_, May 22 2017