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.

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

Table of values

n a(n)
1 1
2 3
3 4
4 7
5 8
6 9
7 10
8 12
9 14
10 15
11 16
12 19
13 20
14 22
15 23
16 24
17 25
18 27
19 31
20 32
21 34
22 37
23 38
24 39
25 40
26 42
27 43
28 44
29 45
30 48
31 49
32 55
33 56
34 57
35 58
36 60
37 61

List of values

[1, 3, 4, 7, 8, 9, 10, 12, 14, 15, 16, 19, 20, 22, 23, 24, 25, 27, 31, 32, 34, 37, 38, 39, 40, 42, 43, 44, 45, 48, 49, 55, 56, 57, 58, 60, 61]