A291680 - cp's OEIS frontend

A291680 Number T(n,k) of permutations p of [n] such that in 0p the largest up-jump equals k and no down-jump is larger than 2; triangle T(n,k), n>=0, 0<=k<=n, read by rows.

n	a(n)
0	1
1	0
2	1
3	0
4	1
5	1
6	0
7	1
8	3
9	2
10	0
11	1
12	9
13	8
14	4
15	0
16	1
17	25
18	36
19	20
20	10
21	0
22	1
23	71
24	156
25	108
26	58
27	26
28	0
29	1
30	205
31	666
32	586
33	340
34	170
35	74
36	0
37	1
38	607
39	2860
40	3098
41	2014
42	1078
43	528
44	218
45	0
46	1
47	1833
48	12336
49	16230
50	11888
51	6772
52	3550
53	1672
54	672
55	0
56	1
57	5635
58	53518
59	85150
60	69274
61	42366
62	23284
63	11840
64	5454
65	2126

[1, 0, 1, 0, 1, 1, 0, 1, 3, 2, 0, 1, 9, 8, 4, 0, 1, 25, 36, 20, 10, 0, 1, 71, 156, 108, 58, 26, 0, 1, 205, 666, 586, 340, 170, 74, 0, 1, 607, 2860, 3098, 2014, 1078, 528, 218, 0, 1, 1833, 12336, 16230, 11888, 6772, 3550, 1672, 672, 0, 1, 5635, 53518, 85150, 69274, 42366, 23284, 11840, 5454, 2126]

cp's OEIS Frontend

A291680 Number T(n,k) of permutations p of [n] such that in 0p the largest up-jump equals k and no down-jump is larger than 2; triangle T(n,k), n>=0, 0<=k<=n, read by rows.

Table of values

List of values