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.
%I A270764 #8 May 26 2018 11:20:09
%S A270764 306298,1416047,7182335,39465366,232773295,1463322425,9749390152,
%T A270764 68521246341,506044752411,3914022281500,31613966755737,
%U A270764 265988973944593,2326016924813242,21099313483973011,198180280866810827,1924398094428234590,19290427455201221715
%N A270764 Total sum of the sizes of all blocks with maximal element 10 in all set partitions of {1,2,...,n}.
%H A270764 Alois P. Heinz, <a href="/A270764/b270764.txt">Table of n, a(n) for n = 10..577</a>
%H A270764 Wikipedia, <a href="https://en.wikipedia.org/wiki/Partition_of_a_set">Partition of a set</a>
%t A270764 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 A270764 a[n_] := b[n, 0, Max[0, 1 + n - 10]][[2]];
%t A270764 Array[a, 24, 10] (* Jean-François Alcover, May 26 2018, from Maple code for A270701 *)
%Y A270764 Column k=10 of A270701.
%Y A270764 A diagonal of A270702.
%K A270764 nonn
%O A270764 10,1
%A A270764 _Alois P. Heinz_, Mar 22 2016