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.

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

This page as a plain text file.
%I A287260 #6 May 22 2017 11:55:36
%S A287260 1,1,2,5,15,52,203,877,4140,21147,115975,678570,4213596,27643409,
%T A287260 190833091,1381223515,10448641031,82388624090,675565642030,
%U A287260 5748668560311,50672729373781,461933478903121,4348527928700455,42216300909368230,422143264687282845
%N A287260 Number of set partitions of [n] such that all absolute differences between least elements of consecutive blocks are <= ten.
%H A287260 Alois P. Heinz, <a href="/A287260/b287260.txt">Table of n, a(n) for n = 0..579</a>
%H A287260 Wikipedia, <a href="https://en.wikipedia.org/wiki/Partition_of_a_set">Partition of a set</a>
%F A287260 a(n) = A287216(n,10).
%F A287260 a(n) = A000110(n) for n <= 11.
%Y A287260 Column k=10 of A287216.
%Y A287260 Cf. A000110.
%K A287260 nonn
%O A287260 0,3
%A A287260 _Alois P. Heinz_, May 22 2017