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.

A321695 For any sequence f of positive integers, let g(f) be the unique Golomb-like sequence with run lengths given by f and let k(f) be the unique Kolakoski-like sequence with run lengths given by f and initial term 1; this sequence is the unique sequence f satisfying f = g(k(f)).

Table of values

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

List of values

[1, 2, 2, 3, 3, 4, 5, 6, 6, 7, 7, 8, 8, 9, 10, 11, 12, 12, 13, 13, 14, 14, 15, 15, 16, 17, 18, 19, 20, 21, 21, 22, 22, 23, 23, 24, 24, 25, 25, 26, 26, 27, 28, 29, 30, 31, 32, 33, 33, 34, 34, 35, 35, 36, 36, 37, 37, 38, 38, 39, 39, 40, 41, 42, 43, 44, 45, 46, 47]

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

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