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.

A101856 Number of non-intersecting polygons that it is possible for an accelerating ant to produce with n steps (rotations & reflections not included). On step 1 the ant moves forward 1 unit, then turns left or right and proceeds 2 units, then turns left or right until at the end of its n-th step it arrives back at its starting place.

Table of values

n a(n)
1 0
2 0
3 0
4 0
5 0
6 0
7 1
8 1
9 0
10 0
11 0
12 0
13 0
14 0
15 1
16 3
17 0
18 0
19 0
20 0
21 0
22 0
23 25
24 67
25 0
26 0
27 0
28 0
29 0
30 0
31 515
32 1259
33 0
34 0
35 0
36 0
37 0
38 0
39 15072
40 41381
41 0
42 0
43 0
44 0
45 0
46 0
47 588066
48 1651922
49 0
50 0
51 0
52 0
53 0
54 0
55 25263990
56 73095122
57 0
58 0
59 0
60 0
61 0
62 0
63 1194909691
64 3492674650
65 0
66 0
67 0
68 0
69 0
70 0

List of values

[0, 0, 0, 0, 0, 0, 1, 1, 0, 0, 0, 0, 0, 0, 1, 3, 0, 0, 0, 0, 0, 0, 25, 67, 0, 0, 0, 0, 0, 0, 515, 1259, 0, 0, 0, 0, 0, 0, 15072, 41381, 0, 0, 0, 0, 0, 0, 588066, 1651922, 0, 0, 0, 0, 0, 0, 25263990, 73095122, 0, 0, 0, 0, 0, 0, 1194909691, 3492674650, 0, 0, 0, 0, 0, 0]

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

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