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.

A089080 Sequence is S(infinity) where S(1)={1,2} and S(n)=S(n-1)S'(n-1), where S'(k) is obtained from S(k) by replacing the single 1 with the least integer not occurring in S(k).

Table of values

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

List of values

[1, 2, 3, 2, 4, 2, 3, 2, 5, 2, 3, 2, 4, 2, 3, 2, 6, 2, 3, 2, 4, 2, 3, 2, 5, 2, 3, 2, 4, 2, 3, 2, 7, 2, 3, 2, 4, 2, 3, 2, 5, 2, 3, 2, 4, 2, 3, 2, 6, 2, 3, 2, 4, 2, 3, 2, 5, 2, 3, 2, 4, 2, 3, 2, 8, 2, 3, 2, 4, 2, 3, 2, 5, 2, 3, 2, 4, 2, 3, 2, 6, 2, 3, 2, 4, 2, 3, 2, 5, 2, 3, 2, 4, 2, 3, 2, 7, 2, 3, 2, 4, 2, 3, 2, 5]