The On-Line Encyclopedia of Integer Sequences (OEIS)

Revision History for A360335 (Bold, blue-underlined text is an addition; faded, red-underlined text is a ~~deletion~~.)
Showing entries 1-10 | older changes

A360335

Array read by antidiagonals downwards: A(n,m) = number of set partitions of [2n] into 2-element subsets {i, i+k} with 1 <= k <= m.
(history; published version)

#21 by Alois P. Heinz at Wed Feb 08 15:15:33 EST 2023

STATUS

editing

approved

#20 by Alois P. Heinz at Wed Feb 08 15:15:31 EST 2023

NAME

Array read by antidiagonals downwarddownwards: A(n,m) = number of set partitions of [2n] into 2-element subsets {i, i+k} with 1 <= k <= m.

STATUS

approved

editing

#19 by Alois P. Heinz at Wed Feb 08 15:14:54 EST 2023

STATUS

proposed

approved

#18 by Peter Dolland at Sat Feb 04 09:22:36 EST 2023

STATUS

editing

proposed

#17 by Peter Dolland at Sat Feb 04 09:22:05 EST 2023

CROSSREFS

Cf. A001147, A104443, A360333, A360334.

STATUS

proposed

editing

#16 by Alois P. Heinz at Fri Feb 03 14:41:25 EST 2023

STATUS

editing

proposed

#15 by Alois P. Heinz at Fri Feb 03 14:41:20 EST 2023

CROSSREFS

Columns 21..4 are A000012, A000045(n+1), A052967, A320346.

STATUS

proposed

editing

#14 by Andrew Howroyd at Fri Feb 03 13:39:31 EST 2023

STATUS

editing

proposed

#13 by Andrew Howroyd at Fri Feb 03 13:38:48 EST 2023

NAME

Square of A(n,m) Array read by antidiagonals downward. : A(n,m) = number of set partitions of [2n] into 2-element subsets {i, i+k} with 1 <= k <= m.

FORMULA

A(n,n) = A014307(n).

A(n,2) = A000045(n+1).

A(n,3) = A052967(n).

A(n,4) = A320346(n).

CROSSREFS

Main diagonal is A014307.

CfColumns 2.. A001147, A104443, A014307, 4 are A000045, (n+1), A052967, A320346.

Cf. A001147, A104443.

STATUS

proposed

editing

#12 by Peter Dolland at Fri Feb 03 10:25:12 EST 2023

STATUS

editing

proposed