A333520 - cp's OEIS frontend

A333520 Triangle read by rows: T(n,k) is the number of self-avoiding paths of length 2*(n-1+k) connecting opposite corners in the n X n grid graph (0 <= k <= floor((n-1)^2/2), n >= 1).

n	a(n)
1	1
2	2
3	6
4	4
5	2
6	20
7	36
8	48
9	48
10	32
11	70
12	224
13	510
14	956
15	1586
16	2224
17	2106
18	732
19	104
20	252
21	1200
22	3904
23	10560
24	25828
25	58712
26	121868
27	217436
28	300380
29	280776
30	170384
31	61336
32	10180
33	924
34	5940
35	25186
36	88084
37	277706
38	821480
39	2309402
40	6140040
41	15130410
42	33339900
43	62692432
44	96096244
45	116826664
46	110195700
47	78154858
48	39287872
49	12396758
50	1879252
51	111712

[1, 2, 6, 4, 2, 20, 36, 48, 48, 32, 70, 224, 510, 956, 1586, 2224, 2106, 732, 104, 252, 1200, 3904, 10560, 25828, 58712, 121868, 217436, 300380, 280776, 170384, 61336, 10180, 924, 5940, 25186, 88084, 277706, 821480, 2309402, 6140040, 15130410, 33339900, 62692432, 96096244, 116826664, 110195700, 78154858, 39287872, 12396758, 1879252, 111712]

cp's OEIS Frontend

A333520 Triangle read by rows: T(n,k) is the number of self-avoiding paths of length 2*(n-1+k) connecting opposite corners in the n X n grid graph (0 <= k <= floor((n-1)^2/2), n >= 1).

Table of values

List of values