login

Year-end appeal: Please make a donation to the OEIS Foundation to support ongoing development and maintenance of the OEIS. We are now in our 61st year, we have over 378,000 sequences, and we’ve reached 11,000 citations (which often say “discovered thanks to the OEIS”).

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

%I #5 Dec 29 2018 16:10:48

%S 0,1,515,22253,430909,6094476,74507486,847129333,9296465127,

%T 100540964675,1085004090887,11775039127122,129155075413877,

%U 1436488582202316,16235344928131625,186710546094489052,2186538096666720967,26085011069325363939,317049671003606985326

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

%H Alois P. Heinz, <a href="/A322883/b322883.txt">Table of n, a(n) for n = 10..579</a>

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

%F a(n) = A287260(n) - A287259(n).

%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-> (k-> A(n, k)-A(n, k-1))(10):

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

%Y Column k=10 of A287215.

%Y Cf. A287259, A287260.

%K nonn

%O 10,3

%A _Alois P. Heinz_, Dec 29 2018