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!)
A322884 Number of set partitions of [2n] such that the maximal absolute difference between the least elements of consecutive blocks equals n. 2

%I #15 Jan 06 2019 13:32:24

%S 1,1,5,39,493,9320,242366,8193031,346270455,17780116911,1085004090887,

%T 77324278953174,6344818280326312,592415284729545433,

%U 62319734032202722887,7323734663214254662683,954467851066831095051393,137065739258353347820981920

%N Number of set partitions of [2n] such that the maximal absolute difference between the least elements of consecutive blocks equals n.

%C a(0) = 1 by convention.

%H Alois P. Heinz, <a href="/A322884/b322884.txt">Table of n, a(n) for n = 0..130</a>

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

%F a(n) = A287215(2n,n).

%e a(1) = 1: 1|2.

%e a(2) = 5: 124|3, 12|34, 12|3|4, 13|2|4, 1|23|4.

%p b:= proc(n, k, m, l) option remember; `if`(n<1, 1,

%p `if`(l-n>k, 0, b(n-1, k, m+1, n))+m*b(n-1, k, m, l))

%p end:

%p A:= (n, k)-> b(n-1, min(k, n-1), 1, n):

%p a:= n-> A(2*n, n)-`if`(n=0, 0, A(2*n, n-1)):

%p seq(a(n), n=0..20);

%t b[n_, k_, m_, l_] := b[n, k, m, l] = If[n < 1, 1, If[l - n > k, 0, b[n - 1, k, m + 1, n]] + m b[n - 1, k, m, l]];

%t A[n_, k_] := b[n - 1, Min[k, n - 1], 1, n];

%t a[n_] := A[2 n, n] - If[n == 0, 0, A[2 n, n - 1]];

%t Table[a[n], {n, 0, 20}] (* _Jean-François Alcover_, Jan 03 2019, translated from Maple *)

%Y Cf. A287215.

%K nonn

%O 0,3

%A _Alois P. Heinz_, Dec 29 2018

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 March 28 09:02 EDT 2024. Contains 371238 sequences. (Running on oeis4.)