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.

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

List of values

[0, 0, 1, 0, 1, 2, 0, 1, 3, 0, 1, 3, 3, 1, 3, 2, 6, 0, 1, 3, 5, 0, 1, 3, 4, 0, 1, 3, 4, 4, 1, 3, 4, 3, 2, 6, 17, 0, 1, 3, 6, 5, 21, 0, 1, 3, 6, 6, 1, 3, 4, 18, 0, 1, 3, 5, 14, 0, 1, 3, 5, 5, 1, 3, 4, 14, 9, 0, 1, 3, 6, 17, 35, 0, 1, 3, 6, 6, 1, 3, 4, 16, 0, 1, 3, 5, 21, 43, 0, 1, 3, 6, 14, 27, 0, 1]