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.

A380107 a(1) = 0; for n >= 1, if there exists an m < n such that a(m) = a(n), take the largest such m and let a(n+1) be the number of distinct runs in the subsequence a(m)..a(n-1). Otherwise, a(n+1) = 0.

Table of values

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

List of values

[0, 0, 1, 0, 2, 0, 2, 2, 1, 4, 0, 4, 2, 4, 2, 2, 1, 5, 0, 6, 0, 2, 5, 4, 7, 0, 5, 4, 4, 1, 8, 0, 5, 5, 1, 4, 5, 3, 0, 6, 11, 0, 3, 4, 6, 5, 6, 2, 12, 0, 7, 13, 0, 3, 9, 0, 3, 3, 1, 13, 6, 10, 0, 6, 3, 6, 2, 11, 14, 0, 6, 5, 14, 4, 15, 0, 6, 6, 1, 13, 13, 1, 2, 11, 11]