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.

A087157 Satisfies a(1)=1, a(A087158(n+1)) = a(n)+1, with a(m)=1 for all m not found in A087158, where A087158(n+2)=A087158(n+1)+a(n)+1.

Table of values

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

List of values

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