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.

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

List of values

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