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.

A308175 Let EM denote the Ehrenfeucht-Mycielski sequence A038219, and let P(n) = [EM(1),...,EM(n)]. To compute EM(n+1) for n>=3, we find the longest suffix S (say) of P(n) which has previously appeared in P(n). Suppose the most recent appearance of S began at index n-t(n). Then a(n) = t(n), while the length of S is given in A308174.

Table of values

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

List of values

[2, 1, 4, 1, 5, 4, 8, 4, 7, 2, 8, 12, 2, 13, 10, 17, 7, 3, 8, 19, 14, 3, 15, 21, 19, 24, 18, 28, 17, 25, 27, 19, 34, 9, 23, 7, 38, 21, 32, 20, 38, 14, 30, 34, 29, 45, 24, 39, 35, 4, 36, 41, 27, 49, 33, 54, 36, 52, 41, 4, 42, 54, 39, 31, 65, 24, 44, 9, 36, 53]