A130534 - cp's OEIS frontend

A130534 Triangle T(n,k), 0 <= k <= n, read by rows, giving coefficients of the polynomial (x+1)(x+2)...(x+n), expanded in increasing powers of x. T(n,k) is also the unsigned Stirling number |s(n+1, k+1)|, denoting the number of permutations on n+1 elements that contain exactly k+1 cycles.

n	a(n)
0	1
1	1
2	1
3	2
4	3
5	1
6	6
7	11
8	6
9	1
10	24
11	50
12	35
13	10
14	1
15	120
16	274
17	225
18	85
19	15
20	1
21	720
22	1764
23	1624
24	735
25	175
26	21
27	1
28	5040
29	13068
30	13132
31	6769
32	1960
33	322
34	28
35	1
36	40320
37	109584
38	118124
39	67284
40	22449
41	4536
42	546
43	36
44	1
45	362880
46	1026576
47	1172700
48	723680
49	269325
50	63273
51	9450
52	870
53	45
54	1

[1, 1, 1, 2, 3, 1, 6, 11, 6, 1, 24, 50, 35, 10, 1, 120, 274, 225, 85, 15, 1, 720, 1764, 1624, 735, 175, 21, 1, 5040, 13068, 13132, 6769, 1960, 322, 28, 1, 40320, 109584, 118124, 67284, 22449, 4536, 546, 36, 1, 362880, 1026576, 1172700, 723680, 269325, 63273, 9450, 870, 45, 1]

cp's OEIS Frontend

A130534 Triangle T(n,k), 0 <= k <= n, read by rows, giving coefficients of the polynomial (x+1)(x+2)...(x+n), expanded in increasing powers of x. T(n,k) is also the unsigned Stirling number |s(n+1, k+1)|, denoting the number of permutations on n+1 elements that contain exactly k+1 cycles.

Table of values

List of values