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.

A346123 Numbers m such that no self-avoiding walk of length m + 1 on the honeycomb net fits into the smallest circle that can enclose a walk of length m.

Table of values

n a(n)
1 1
2 2
3 6
4 7
5 10
6 12
7 13
8 14
9 15
10 16
11 23
12 24
13 25
14 27
15 28
16 30
17 33
18 36
19 37
20 38
21 42
22 43
23 46
24 53
25 54
26 55
27 56
28 58
29 59
30 62

List of values

[1, 2, 6, 7, 10, 12, 13, 14, 15, 16, 23, 24, 25, 27, 28, 30, 33, 36, 37, 38, 42, 43, 46, 53, 54, 55, 56, 58, 59, 62]