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.

A377648 Parse Golomb's sequence (A001462) into distinct phrases [1], [2], [2, 3], [3], [4], [4, 4], [5], [5, 5], ...; a(n) is the length of n-th phrase.

Table of values

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

List of values

[1, 1, 2, 1, 1, 2, 1, 2, 1, 2, 2, 1, 2, 1, 2, 2, 1, 2, 2, 1, 2, 2, 1, 2, 2, 1, 2, 3, 1, 2, 3, 1, 2, 3, 1, 2, 3, 1, 2, 3, 1, 2, 3, 2, 1, 2, 3, 1, 2, 3, 2, 1, 2, 3, 2, 1, 2, 3, 2, 1, 2, 3, 2, 1, 2, 3, 2, 1, 2, 3, 3, 1, 2, 3, 3, 1, 2, 3, 3, 1, 2, 3, 3, 1, 2, 3, 3]

Started in 1964 by Neil J. A. Sloane | Maintained by The OEIS Foundation Inc.

Content is available under The OEIS End-User License Agreement.