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.

A309997 Number of paths from 2 to n of length A307092(n) - 1 via maps of the form x -> x + x^j, where j is a nonnegative integer.

Table of values

n a(n)
2 1
3 1
4 1
5 1
6 1
7 1
8 1
9 1
10 1
11 1
12 2
13 2
14 1
15 1
16 1
17 1
18 1
19 1
20 2
21 2
22 1
23 1
24 2
25 2
26 2
27 2
28 1
29 1
30 1
31 1
32 2
33 2
34 1
35 1
36 1
37 1
38 1
39 1
40 2
41 2
42 1
43 1
44 2
45 2
46 1
47 1
48 2
49 2
50 2
51 2
52 2
53 2
54 2
55 2
56 1
57 1
58 1
59 1
60 1
61 1
62 1
63 1
64 2
65 2
66 1
67 1
68 2
69 2
70 1
71 1
72 2
73 2
74 1
75 1
76 1
77 1
78 1
79 1
80 2
81 2
82 2
83 2
84 1
85 1
86 2
87 2
88 2

List of values

[1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 2, 2, 1, 1, 1, 1, 1, 1, 2, 2, 1, 1, 2, 2, 2, 2, 1, 1, 1, 1, 2, 2, 1, 1, 1, 1, 1, 1, 2, 2, 1, 1, 2, 2, 1, 1, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 2, 2, 1, 1, 2, 2, 1, 1, 2, 2, 1, 1, 1, 1, 1, 1, 2, 2, 2, 2, 1, 1, 2, 2, 2]