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.

A346132 Numbers m such that no self-avoiding walk that can make turns from the set 0, +-Pi/6, +-2*Pi/6, +-3*Pi/6, +-4*Pi/6, +-5*Pi/6, 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 3
4 4
5 5
6 6
7 7
8 8
9 9
10 10
11 11
12 12
13 13
14 14
15 15
16 16
17 17
18 18
19 19
20 21
21 22
22 23
23 24
24 25
25 26
26 29
27 30
28 32
29 33
30 34
31 35
32 36
33 37
34 41

List of values

[1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13, 14, 15, 16, 17, 18, 19, 21, 22, 23, 24, 25, 26, 29, 30, 32, 33, 34, 35, 36, 37, 41]

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

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