login

Revision History for A001118

(Bold, blue-underlined text is an addition; faded, red-underlined text is a deletion.)

Showing entries 1-10 | older changes
Number of labeled ordered set partitions into 5 parts for n>=1, a(0)=1.
(history; published version)
#81 by Ray Chandler at Sun Jun 25 02:22:39 EDT 2023
STATUS

editing

approved

#80 by Ray Chandler at Sun Jun 25 02:22:33 EDT 2023
LINKS

<a href="/index/Rec#order_05">Index entries for linear recurrences with constant coefficients</a>, signature (15, -85, 225, -274, 120).

STATUS

approved

editing

#79 by Alois P. Heinz at Sun Apr 02 12:20:44 EDT 2023
STATUS

editing

approved

#78 by Alois P. Heinz at Sun Apr 02 12:20:11 EDT 2023
DATA

1, 0, 0, 0, 0, 120, 1800, 16800, 126000, 834120, 5103000, 29607600, 165528000, 901020120, 4809004200, 25292030400, 131542866000, 678330198120, 3474971465400, 17710714165200, 89904730860000, 454951508208120, 2296538629446600, 11570026582092000, 58200094019430000

#77 by Alois P. Heinz at Sun Apr 02 12:18:58 EDT 2023
NAME

Number of labeled ordered set partitions into 5 parts for n>=1, a(0)=1.

#76 by Alois P. Heinz at Sun Apr 02 12:17:57 EDT 2023
NAME

Number of labeled ordered set partitions into 5 parts.

FORMULA

a(n) = [n=0] + 5!*S(n, 5).

E.g.f.: 1 + (e^x-1)^5.

EXTENSIONS

Name changed edited by Harry Richman, Mar 31 2023

#75 by Alois P. Heinz at Sun Apr 02 12:16:54 EDT 2023
STATUS

proposed

editing

#74 by Harry Richman at Fri Mar 31 17:41:45 EDT 2023
STATUS

editing

proposed

#73 by Harry Richman at Fri Mar 31 17:41:36 EDT 2023
EXTENSIONS

Name changed by Harry Richman, Mar 31 2023

STATUS

proposed

editing

#72 by Harry Richman at Fri Mar 31 17:33:29 EDT 2023
STATUS

editing

proposed