A287252 -id:A287252 - cp's OEIS frontend

A287216 Number A(n,k) of set partitions of [n] such that all absolute differences between least elements of consecutive blocks are <= k; square array A(n,k), n>=0, k>=0, read by antidiagonals.

1, 1, 1, 1, 1, 1, 1, 1, 2, 1, 1, 1, 2, 4, 1, 1, 1, 2, 5, 9, 1, 1, 1, 2, 5, 14, 23, 1, 1, 1, 2, 5, 15, 44, 66, 1, 1, 1, 2, 5, 15, 51, 152, 210, 1, 1, 1, 2, 5, 15, 52, 191, 571, 733, 1, 1, 1, 2, 5, 15, 52, 202, 780, 2317, 2781, 1, 1, 1, 2, 5, 15, 52, 203, 857, 3440, 10096, 11378, 1

Offset: 0

Alois P. Heinz, May 21 2017

			A(4,0) = 1: 1234.
A(4,1) = 9: 1234, 134|2, 13|24, 14|23, 1|234, 14|2|3, 1|24|3, 1|2|34, 1|2|3|4.
A(4,2) = 14: 1234, 124|3, 12|34, 12|3|4, 134|2, 13|24, 13|2|4, 14|23, 1|234, 1|23|4, 14|2|3, 1|24|3, 1|2|34, 1|2|3|4.
A(5,1) = 23: 12345, 1345|2, 134|25, 135|24, 13|245, 145|23, 14|235, 15|234, 1|2345, 145|2|3, 14|25|3, 14|2|35, 15|24|3, 1|245|3, 1|24|35, 15|2|34, 1|25|34, 1|2|345, 15|2|3|4, 1|25|3|4, 1|2|35|4, 1|2|3|45, 1|2|3|4|5.
Square array A(n,k) begins:
  1,   1,   1,   1,   1,   1,   1,   1, ...
  1,   1,   1,   1,   1,   1,   1,   1, ...
  1,   2,   2,   2,   2,   2,   2,   2, ...
  1,   4,   5,   5,   5,   5,   5,   5, ...
  1,   9,  14,  15,  15,  15,  15,  15, ...
  1,  23,  44,  51,  52,  52,  52,  52, ...
  1,  66, 152, 191, 202, 203, 203, 203, ...
  1, 210, 571, 780, 857, 876, 877, 877, ...

Alois P. Heinz, Antidiagonals n = 0..140, flattened
Wikipedia, Partition of a set

Columns k=0-10 give: A000012, A026898(n-1) for n>0, A287252, A287253, A287254, A287255, A287256, A287257, A287258, A287259, A287260.
Main diagonal gives A000110.
Cf. A287214, A287215, A287417, A287641.

b:= proc(n, k, m, l) option remember; `if`(n<1, 1,
     `if`(l-n>k, 0, b(n-1, k, m+1, n))+m*b(n-1, k, m, l))
    end:
A:= (n, k)-> b(n-1, min(k, n-1), 1, n):
seq(seq(A(n, d-n), n=0..d), d=0..12);

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]];
A[n_, k_] := b[n - 1, Min[k, n - 1], 1, n];
Table[A[n, d - n], {d, 0, 12}, {n, 0, d}] // Flatten (* Jean-François Alcover, Apr 30 2018, after Alois P. Heinz *)

A(n,k) = Sum_{j=0..k} A287215(n,j).

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

Original entry on oeis.org

0, 1, 5, 21, 86, 361, 1584, 7315, 35635, 183080, 990659, 5635021, 33622161, 209973099, 1369560267, 9310957518, 65852852210, 483672626464, 3683088047043, 29033382412670, 236591717703447, 1990467019391404, 17268021545339042, 154304401318961489

Offset: 2

Alois P. Heinz, Dec 29 2018

nonn

Alois P. Heinz, Table of n, a(n) for n = 2..590
Wikipedia, Partition of a set

Column k=2 of A287215.

Cf. A026898, A287252.

b:= proc(n, k, m, l) option remember; `if`(n<1, 1,
     `if`(l-n>k, 0, b(n-1, k, m+1, n))+m*b(n-1, k, m, l))
    end:
A:= (n, k)-> b(n-1, min(k, n-1), 1, n):
a:= n-> (k-> A(n, k)-A(n, k-1))(2):
seq(a(n), n=2..30);

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]];
A[n_, k_] := b[n - 1, Min[k, n - 1], 1, n];
a[n_] := With[{k = 2}, A[n, k] - A[n, k - 1]];
a /@ Range[2, 30] (* Jean-François Alcover, Dec 14 2020, after Alois P. Heinz *)

a(n) = A287252(n) - A026898(n-1).

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

Original entry on oeis.org

0, 1, 7, 39, 209, 1123, 6153, 34723, 202852, 1229672, 7742792, 50653678, 344195782, 2427812876, 17761759538, 134650690097, 1056676856777, 8574943334545, 71881479393513, 621792661601615, 5544644720281979, 50918125911279963, 481093310682127190

Offset: 3

Alois P. Heinz, Dec 29 2018

nonn

Alois P. Heinz, Table of n, a(n) for n = 3..586
Wikipedia, Partition of a set

Column k=3 of A287215.

Cf. A287252, A287253.

b:= proc(n, k, m, l) option remember; `if`(n<1, 1,
     `if`(l-n>k, 0, b(n-1, k, m+1, n))+m*b(n-1, k, m, l))
    end:
A:= (n, k)-> b(n-1, min(k, n-1), 1, n):
a:= n-> (k-> A(n, k)-A(n, k-1))(3):
seq(a(n), n=3..30);

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]];
A[n_, k_] := b[n - 1, Min[k, n - 1], 1, n];
a[n_] := With[{k = 3}, A[n, k] - A[n, k - 1]];
a /@ Range[3, 30] (* Jean-François Alcover, May 05 2020, after Maple *)

a(n) = A287253(n) - A287252(n).

cp's OEIS Frontend

A287216 Number A(n,k) of set partitions of [n] such that all absolute differences between least elements of consecutive blocks are <= k; square array A(n,k), n>=0, k>=0, read by antidiagonals.

Views

Author

Keywords

Examples

Links

Crossrefs

Programs

Maple

Mathematica

Formula

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

Views

Author

Keywords

Links

Crossrefs

Programs

Maple

Mathematica

Formula

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

Views

Author

Keywords

Links

Crossrefs

Programs

Maple

Mathematica

Formula