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.

A380037 For n >= 1, if there exists an m < n such that a(m) = a(n), take the largest such m and set a(n+1) as 1 more than the number of positive terms between a(m+1) and a(n-1). Otherwise, a(n+1) = -1. Start with a(1) = 0.

Table of values

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

List of values

[0, -1, -1, 1, -1, 2, -1, 2, 1, 3, -1, 4, -1, 2, 4, 2, 2, 1, 7, -1, 7, 1, 3, 10, -1, 5, -1, 2, 8, -1, 3, 5, 4, 14, -1, 5, 3, 5, 2, 9, -1, 6, -1, 2, 3, 6, 3, 2, 4, 13, -1, 8, 18, -1, 3, 6, 8, 4, 7, 30, -1, 7, 2, 12, -1, 4, 6, 9, 22, -1, 5, 26]