The On-Line Encyclopedia of Integer Sequences (OEIS)

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

A080510

Triangle read by rows: T(n,k) gives the number of set partitions of {1,...,n} with maximum block length k.
(history; published version)

#72 by Alois P. Heinz at Wed Feb 16 07:40:28 EST 2022

STATUS

reviewed

approved

#71 by Joerg Arndt at Wed Feb 16 02:45:20 EST 2022

STATUS

proposed

reviewed

Discussion

Wed Feb 16

03:40

Michel Marcus: you know that you can type text in the discssion box to answer editors questions ?

#70 by Alois P. Heinz at Tue Feb 15 20:43:35 EST 2022

STATUS

editing

proposed

#69 by Alois P. Heinz at Tue Feb 15 20:43:30 EST 2022

CROSSREFS

Cf. A080107, A080337, A008277, A178979, A276922, A327884.

STATUS

proposed

editing

#68 by Ludovic Schwob at Sun Jan 16 11:28:12 EST 2022

STATUS

editing

proposed

#67 by Joerg Arndt at Sun Jan 16 08:44:02 EST 2022

STATUS

proposed

editing

#66 by Jon E. Schoenfield at Sat Jan 15 15:51:52 EST 2022

STATUS

editing

proposed

Discussion

Sun Jan 16

08:44

Joerg Arndt: A000110(n)-1/2 is not an integer, right?

#65 by Jon E. Schoenfield at Sat Jan 15 15:51:49 EST 2022

COMMENTS

Partition product of Product_{j=0..n-1} ((k + 1)*j - 1) and n! at k = -1, summed over parts with equal biggest part (see the Luschny link).

FORMULA

f^a = (f_1/1!)^a_1*...*(f_n/n!)^a_n and f_n = Product_{j=0..n-1} (-1) = (-1)^n. (End)

STATUS

proposed

editing

#64 by Jon E. Schoenfield at Sat Jan 15 15:44:49 EST 2022

STATUS

editing

proposed

#63 by Jon E. Schoenfield at Sat Jan 15 15:44:46 EST 2022

FORMULA

T(n,m) = C(n,m)*A000110(n-m) for 2m > n > 0. (End)

STATUS

proposed

editing