cp's OEIS Frontend

This is a front-end for the Online Encyclopedia of Integer Sequences, made by Christian Perfect. The idea is to provide OEIS entries in non-ancient HTML, and then to think about how they're presented visually. The source code is on GitHub.

A309500 The minimal number of steps to return to the origin for a self-avoiding walk with step-length n on 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

n a(n)
1 4
2 4
3 4
4 4
5 36
6 4
7 4
8 4
9 4
10 36
11 4
12 4
13 122
14 4
15 36
16 4
17 198
18 4
19 4
20 36
21 4
22 4
23 4
24 4
25 436
26 122
27 4
28 4
29 632
30 36
31 4
32 4
33 4
34 198
35 36
36 4
37 694
38 4
39 122
40 36

List of values

[4, 4, 4, 4, 36, 4, 4, 4, 4, 36, 4, 4, 122, 4, 36, 4, 198, 4, 4, 36, 4, 4, 4, 4, 436, 122, 4, 4, 632, 36, 4, 4, 4, 198, 36, 4, 694, 4, 122, 36]

Started in 1964 by Neil J. A. Sloane | Maintained by The OEIS Foundation Inc.

Content is available under The OEIS End-User License Agreement.