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.

A270756 Total sum of the sizes of all blocks with maximal element 2 in all set partitions of {1,2,...,n}.

This page as a plain text file.
%I A270756 #10 May 26 2018 11:20:39
%S A270756 3,4,9,25,82,307,1283,5894,29427,158269,910520,5570737,36071631,
%T A270756 246188196,1764757189,13246059237,103825154098,847806545767,
%U A270756 7196895817375,63389642645486,578318132627495,5456455370760825,53165437331978992,534262881004973981
%N A270756 Total sum of the sizes of all blocks with maximal element 2 in all set partitions of {1,2,...,n}.
%H A270756 Alois P. Heinz, <a href="/A270756/b270756.txt">Table of n, a(n) for n = 2..577</a>
%H A270756 Wikipedia, <a href="https://en.wikipedia.org/wiki/Partition_of_a_set">Partition of a set</a>
%t A270756 b[n_, m_, t_] := b[n, m, t] = If[n == 0, {1, 0}, Sum[If[t == 1 && j != m + 1, 0, Function[p, p + If[j == -t || t == 1 && j == m + 1, {0, p[[1]]}, 0]][b[n - 1, Max[m, j], If[t == 1 && j == m + 1, -j, If[t < 0, t, If[t > 0, t - 1, 0]]]]]], {j, 1, m + 1}]];
%t A270756 a[n_] := b[n, 0, Max[0, 1 + n - 2]][[2]];
%t A270756 Array[a, 24, 2] (* _Jean-François Alcover_, May 26 2018, from Maple code for A270701 *)
%Y A270756 Column k=2 of A270701.
%Y A270756 A diagonal of A270702.
%K A270756 nonn
%O A270756 2,1
%A A270756 _Alois P. Heinz_, Mar 22 2016