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.

A288533 Parse A004736 into distinct phrases [1], [2], [1,3], [2,1], [4], [3], [2,1,5], [4,3], [2,1,6], ...; a(n) is the length of the n-th phrase.

Table of values

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

List of values

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