A348334 - cp's OEIS frontend

A348334 Table read by downward antidiagonals: T(n,k) is the number of self-avoiding walks on a 2D square lattice for a chain growing to total length n after taking k steps (see Comments lines).

n	a(n)
1	4
2	12
3	4
4	36
5	12
6	4
7	108
8	36
9	12
10	4
11	324
12	108
13	36
14	12
15	4
16	972
17	324
18	108
19	36
20	12
21	4
22	2916
23	972
24	324
25	100
26	36
27	12
28	4
29	8748
30	2916
31	972
32	284
33	100
34	36
35	12
36	4
37	26244
38	8748
39	2916
40	804
41	284
42	100
43	36
44	12
45	4
46	78732
47	26244
48	8748
49	2276
50	804
51	284
52	100
53	36
54	12
55	4

[4, 12, 4, 36, 12, 4, 108, 36, 12, 4, 324, 108, 36, 12, 4, 972, 324, 108, 36, 12, 4, 2916, 972, 324, 100, 36, 12, 4, 8748, 2916, 972, 284, 100, 36, 12, 4, 26244, 8748, 2916, 804, 284, 100, 36, 12, 4, 78732, 26244, 8748, 2276, 804, 284, 100, 36, 12, 4]

cp's OEIS Frontend

A348334 Table read by downward antidiagonals: T(n,k) is the number of self-avoiding walks on a 2D square lattice for a chain growing to total length n after taking k steps (see Comments lines).

Table of values

List of values