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.

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

List of values

[0, 0, 1, 0, 2, 0, 2, 2, 1, 5, 0, 4, 0, 2, 6, 0, 3, 0, 2, 5, 10, 0, 4, 11, 0, 3, 9, 0, 3, 3, 1, 21, 0, 4, 10, 13, 0, 4, 4, 1, 8, 0, 4, 4, 1, 4, 2, 25, 0, 6, 32, 0, 3, 21, 20, 0, 4, 11, 31, 0, 4, 4, 1, 17, 0, 4, 4, 1, 4, 2, 21, 15, 0, 7, 0, 2, 6, 25, 28, 0, 5, 56]