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.

A271759 Number of set partitions of [n+8] such that n is the largest element of the last block.

This page as a plain text file.
%I A271759 #4 Apr 13 2016 15:25:16
%S A271759 0,1,258,7589,114799,1351412,14220459,142084077,1389893708,
%T A271759 13540170651,132693048551,1316256290186,13267436553245,
%U A271759 136223753571349,1426933424886202,15263063171191857,166798075310353571,1862748034961296684,21259303294075547951
%N A271759 Number of set partitions of [n+8] such that n is the largest element of the last block.
%H A271759 Alois P. Heinz, <a href="/A271759/b271759.txt">Table of n, a(n) for n = 1..569</a>
%H A271759 Wikipedia, <a href="https://en.wikipedia.org/wiki/Partition_of_a_set">Partition of a set</a>
%F A271759 a(n) = A271466(n+8,n).
%Y A271759 A diagonal of A271466.
%K A271759 nonn
%O A271759 1,3
%A A271759 _Alois P. Heinz_, Apr 13 2016