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.

A346124 Numbers m such that no self-avoiding walk of length m + 1 on the square lattice fits into the smallest circle that can enclose a walk of length m.

Table of values

n a(n)
1 1
2 4
3 6
4 8
5 12
6 14
7 15
8 16
9 18
10 20
11 21
12 23
13 24
14 25
15 26
16 27
17 28
18 32
19 34
20 36
21 38
22 44
23 46
24 48
25 52
26 56
27 58
28 60

List of values

[1, 4, 6, 8, 12, 14, 15, 16, 18, 20, 21, 23, 24, 25, 26, 27, 28, 32, 34, 36, 38, 44, 46, 48, 52, 56, 58, 60]