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.

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

List of values

[1, 2, 3, 4, 6, 8, 9, 10, 11, 12, 13, 14, 15, 16, 17, 18, 19, 22, 23, 24, 26, 27, 28, 29, 30, 31, 32, 33, 34, 35, 36, 37, 38, 39, 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.