A001100 - cp's OEIS frontend

A001100 Triangle read by rows: T(n,k) = number of permutations of length n with exactly k rising or falling successions, for n >= 1, 0 <= k <= n-1.

n	a(n)
1	1
2	0
3	2
4	0
5	4
6	2
7	2
8	10
9	10
10	2
11	14
12	40
13	48
14	16
15	2
16	90
17	230
18	256
19	120
20	22
21	2
22	646
23	1580
24	1670
25	888
26	226
27	28
28	2
29	5242
30	12434
31	12846
32	7198
33	2198
34	366
35	34
36	2
37	47622
38	110320
39	112820
40	64968
41	22120
42	4448
43	540
44	40
45	2
46	479306
47	1090270
48	1108612
49	650644
50	236968
51	54304
52	7900
53	748
54	46
55	2

[1, 0, 2, 0, 4, 2, 2, 10, 10, 2, 14, 40, 48, 16, 2, 90, 230, 256, 120, 22, 2, 646, 1580, 1670, 888, 226, 28, 2, 5242, 12434, 12846, 7198, 2198, 366, 34, 2, 47622, 110320, 112820, 64968, 22120, 4448, 540, 40, 2, 479306, 1090270, 1108612, 650644, 236968, 54304, 7900, 748, 46, 2]

cp's OEIS Frontend

A001100 Triangle read by rows: T(n,k) = number of permutations of length n with exactly k rising or falling successions, for n >= 1, 0 <= k <= n-1.

Table of values

List of values