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!)
A285371 Sum of the entries in the ninth blocks of all set partitions of [n]. 2

%I #7 May 27 2018 08:08:59

%S 9,460,13365,291312,5313419,85887795,1273861815,17739276489,

%T 235727269842,3025136223480,37838768653358,464684701656546,

%U 5636371498958757,67862072916294706,814494099000392487,9780912755503955712,117894823818639390505,1430383074839724093993

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

%H Alois P. Heinz, <a href="/A285371/b285371.txt">Table of n, a(n) for n = 9..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,9).

%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=9, 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=9..30);

%t a[h_] := a[h] = Module[{b}, b[n_, m_] := b[n, m] = If[n == 0, {1, 0}, Sum[Function[p, If[j == 9, 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, 9, 30}] (* _Jean-François Alcover_, May 27 2018, from Maple *)

%Y Column k=9 of A285362.

%K nonn

%O 9,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 April 25 06:49 EDT 2024. Contains 371964 sequences. (Running on oeis4.)