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.

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

This page as a plain text file.
%I A271761 #4 Apr 13 2016 15:36:18
%S A271761 0,1,1026,63149,1475239,23407652,309878787,3737612685,42937377908,
%T A271761 481614364251,5353760622719,59537802756962,666437711111693,
%U A271761 7539316084416469,86438641415398090,1006237980519894441,11908561958667363035,143399541797225954572
%N A271761 Number of set partitions of [n+10] such that n is the largest element of the last block.
%H A271761 Alois P. Heinz, <a href="/A271761/b271761.txt">Table of n, a(n) for n = 1..567</a>
%H A271761 Wikipedia, <a href="https://en.wikipedia.org/wiki/Partition_of_a_set">Partition of a set</a>
%F A271761 a(n) = A271466(n+10,n).
%Y A271761 A diagonal of A271466.
%K A271761 nonn
%O A271761 1,3
%A A271761 _Alois P. Heinz_, Apr 13 2016