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.

A358405 a(1) = 0; for n > 1, let a(n-1) = m; if a(n-1) is the first occurrence of m then a(n) = 0, but if there is a k < n-1 with a(k) = m, a(n) is the maximum of n-1-k and j, where a(j) is the first occurrence of m in the sequence.

Table of values

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

List of values

[0, 0, 1, 0, 2, 0, 2, 5, 0, 3, 0, 2, 5, 8, 0, 4, 0, 2, 6, 0, 3, 11, 0, 3, 10, 0, 3, 10, 25, 0, 4, 16, 0, 3, 10, 25, 29, 0, 5, 26, 0, 3, 10, 25, 29, 37, 0, 6, 29, 37, 46, 0, 5, 14, 0, 3, 14, 54, 0, 4, 29, 37, 46, 51, 0, 6, 19, 0, 3, 13, 0, 3, 10, 30, 0, 4, 16, 45, 0, 4, 16, 32, 0, 4, 16, 32, 82]