A309501 - cp's OEIS frontend

A309501 a(n) is the minimal number of steps to return to the origin for a self-avoiding walk with step-length n confined to one quadrant of a 2D plane where at each step the walk must go to an unvisited point with integer coordinates as close as possible to the origin.

n	a(n)
1	4
2	4
3	4
4	4
5	20
6	4
7	4
8	4
9	4
10	20
11	4
12	4
13	6
14	4
15	20
16	4
17	120
18	4
19	4
20	20
21	4
22	4
23	4
24	4
25	6
26	6
27	4
28	4
29	32
30	20
31	4
32	4
33	4
34	120
35	20
36	4
37	6
38	4
39	6
40	20
41	6
42	4
43	4
44	4
45	20
46	4
47	4
48	4
49	4
50	6
51	120
52	6
53	2452
54	4
55	20
56	4
57	4
58	32
59	4
60	20
61	6
62	4
63	4
64	4
65	62
66	4
67	4
68	120
69	4
70	20
71	4
72	4
73	222
74	6
75	6

[4, 4, 4, 4, 20, 4, 4, 4, 4, 20, 4, 4, 6, 4, 20, 4, 120, 4, 4, 20, 4, 4, 4, 4, 6, 6, 4, 4, 32, 20, 4, 4, 4, 120, 20, 4, 6, 4, 6, 20, 6, 4, 4, 4, 20, 4, 4, 4, 4, 6, 120, 6, 2452, 4, 20, 4, 4, 32, 4, 20, 6, 4, 4, 4, 62, 4, 4, 120, 4, 20, 4, 4, 222, 6, 6]

cp's OEIS Frontend

A309501 a(n) is the minimal number of steps to return to the origin for a self-avoiding walk with step-length n confined to one quadrant of a 2D plane where at each step the walk must go to an unvisited point with integer coordinates as close as possible to the origin.

Table of values

List of values