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.

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

This page as a plain text file.
%I A271758 #5 Apr 13 2016 15:19:39
%S A271758 0,1,130,2703,33365,340030,3195161,29058813,262138728,2377526345,
%T A271758 21850848681,204453592904,1953119434331,19080748941293,
%U A271758 190810410926266,1954112246621755,20497535793993225,220206906232309694,2422414243364061229,27278730807823249481
%N A271758 Number of set partitions of [n+7] such that n is the largest element of the last block.
%H A271758 Alois P. Heinz, <a href="/A271758/b271758.txt">Table of n, a(n) for n = 1..570</a>
%H A271758 Wikipedia, <a href="https://en.wikipedia.org/wiki/Partition_of_a_set">Partition of a set</a>
%F A271758 a(n) = A271466(n+7,n).
%e A271758 a(2) = 1: 13456789|2.
%Y A271758 A diagonal of A271466.
%K A271758 nonn
%O A271758 1,3
%A A271758 _Alois P. Heinz_, Apr 13 2016