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.

A270502 Sum of the sizes of the tenth blocks in all set partitions of {1,2,...,n}.

This page as a plain text file.
%I A270502 #10 May 27 2018 06:51:18
%S A270502 1,57,1839,44346,891892,15848311,257647088,3921554995,56796169899,
%T A270502 792102157717,10734723141617,142380931674179,1858965371935248,
%U A270502 24006134113802346,307860388231938976,3934302726222970593,50254089923100713719,643301179860716506788
%N A270502 Sum of the sizes of the tenth blocks in all set partitions of {1,2,...,n}.
%H A270502 Alois P. Heinz, <a href="/A270502/b270502.txt">Table of n, a(n) for n = 10..575</a>
%H A270502 Wikipedia, <a href="https://en.wikipedia.org/wiki/Partition_of_a_set">Partition of a set</a>
%p A270502 b:= proc(n, m) option remember; `if`(n=0, [1, 0],
%p A270502       add((p->`if`(j<11, [p[1], p[2]+p[1]*x^j], p))(
%p A270502        b(n-1, max(m, j))), j=1..m+1))
%p A270502     end:
%p A270502 a:= n-> coeff(b(n, 0)[2], x, 10):
%p A270502 seq(a(n), n=10..30);
%t A270502 b[n_, m_] := b[n, m] = If[n == 0, {1, 0}, Sum[Function[p, If[j < 11, {p[[1]], p[[2]] + p[[1]]*x^j}, p]][b[n - 1, Max[m, j]]], {j, 1, m + 1}]];
%t A270502 a[n_] := Coefficient[b[n, 0][[2]], x, 10];
%t A270502 Table[a[n], {n, 10, 30}] (* _Jean-François Alcover_, May 27 2018, translated from Maple *)
%Y A270502 Column p=10 of A270236.
%K A270502 nonn
%O A270502 10,2
%A A270502 _Alois P. Heinz_, Mar 18 2016