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.

A346128 Numbers m such that no self-avoiding walk that can make turns from the set 0, +-Pi/4, +-Pi/2, +-3*Pi/4, of length m + 1 fits into the smallest circle that can enclose a walk of length m.

Table of values

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

List of values

[1, 2, 4, 5, 7, 8, 9, 11, 12, 13, 15, 17, 18, 19, 20, 22, 23, 24, 25, 26, 27, 28, 30, 31, 32, 33, 34, 35, 36, 37, 38]

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

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