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.

A187187 Parse the infinite string 0123456780123456780123456780... into distinct phrases 0, 1, 2, 3, 4, 5, 6, 7, 8, 01, 23, 45, 67, 80, 12, 34, 56, 78, 012, ...; a(n) = length of n-th phrase.

Table of values

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

List of values

[1, 1, 1, 1, 1, 1, 1, 1, 1, 2, 2, 2, 2, 2, 2, 2, 2, 2, 3, 3, 3, 4, 3, 3, 3, 4, 3, 3, 3, 4, 4, 4, 4, 4, 4, 4, 5, 5, 5, 5, 5, 5, 5, 5, 5, 6, 6, 6, 7, 6, 6, 6, 7, 6, 6, 6, 7, 7, 7, 7, 7, 7, 7, 8, 8, 8, 8, 8, 8, 8, 8, 8, 9, 10, 9, 10, 9, 10, 9, 10, 9, 10, 9, 10, 9, 10, 9, 10, 9, 10, 11, 11, 11, 11, 11, 11, 11, 11, 11, 12, 12, 12, 13, 12, 12, 12, 13, 12, 12, 12, 13, 13, 13, 13, 13, 13, 13, 14, 14, 14]