login
The OEIS is supported by the many generous donors to the OEIS Foundation.

 

Logo
Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A285372 Sum of the entries in the tenth blocks of all set partitions of [n]. 2

%I #7 May 27 2018 08:09:14

%S 10,616,21318,547857,11676343,218761153,3732864275,59392240551,

%T 895833879036,12967143328027,181820930739504,2487908867278337,

%U 33420903985242540,442951837401015291,5816787707500820380,75959640100454216760,989568067595589010921

%N Sum of the entries in the tenth blocks of all set partitions of [n].

%H Alois P. Heinz, <a href="/A285372/b285372.txt">Table of n, a(n) for n = 10..400</a>

%H Wikipedia, <a href="https://en.wikipedia.org/wiki/Partition_of_a_set">Partition of a set</a>

%F a(n) = A285362(n,10).

%p a:= proc(h) option remember; local b; b:=

%p proc(n, m) option remember;

%p `if`(n=0, [1, 0], add((p-> `if`(j=10, p+ [0,

%p (h-n+1)*p[1]], p))(b(n-1, max(m, j))), j=1..m+1))

%p end: b(h, 0)[2]

%p end:

%p seq(a(n), n=10..30);

%t a[h_] := a[h] = Module[{b}, b[n_, m_] := b[n, m] = If[n == 0, {1, 0}, Sum[Function[p, If[j == 10, p + {0, (h - n + 1)*p[[1]]}, p]][b[n - 1, Max[m, j]]], {j, 1, m + 1}]]; b[h, 0][[2]]];

%t Table[a[n], {n, 10, 30}] (* _Jean-François Alcover_, May 27 2018, from Maple *)

%Y Column k=10 of A285362.

%K nonn

%O 10,1

%A _Alois P. Heinz_, Apr 17 2017

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recents
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy. .

Last modified August 12 15:11 EDT 2024. Contains 375113 sequences. (Running on oeis4.)