A318191 - cp's OEIS frontend

A318191 Number A(n,k) of lattice paths from {n}^k to {0}^k using steps that decrement one component by 1 such that for each point p we have abs(p_{i}-p_{(i mod k)+1}) <= 1 and the first component used is p_1; square array A(n,k), n>=0, k>=0, read by antidiagonals.

n	a(n)
0	1
1	1
2	1
3	1
4	1
5	1
6	1
7	1
8	1
9	1
10	1
11	2
12	2
13	1
14	1
15	1
16	6
17	12
18	4
19	1
20	1
21	1
22	24
23	180
24	72
25	8
26	1
27	1
28	1
29	120
30	4680
31	5400
32	432
33	16
34	1
35	1
36	1
37	720
38	187200
39	914400
40	162000
41	2592
42	32
43	1
44	1
45	1
46	5040
47	10634400
48	296438400
49	178660800
50	4860000
51	15552
52	64
53	1
54	1
55	1
56	40320
57	813664800
58	162273628800
59	469551168000
60	34907788800
61	145800000
62	93312
63	128
64	1
65	1

[1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 2, 2, 1, 1, 1, 6, 12, 4, 1, 1, 1, 24, 180, 72, 8, 1, 1, 1, 120, 4680, 5400, 432, 16, 1, 1, 1, 720, 187200, 914400, 162000, 2592, 32, 1, 1, 1, 5040, 10634400, 296438400, 178660800, 4860000, 15552, 64, 1, 1, 1, 40320, 813664800, 162273628800, 469551168000, 34907788800, 145800000, 93312, 128, 1, 1]

cp's OEIS Frontend

A318191 Number A(n,k) of lattice paths from {n}^k to {0}^k using steps that decrement one component by 1 such that for each point p we have abs(p_{i}-p_{(i mod k)+1}) <= 1 and the first component used is p_1; square array A(n,k), n>=0, k>=0, read by antidiagonals.

Table of values

List of values