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.

A353778 a(1)=1. If a(n) is a novel term (seen for first time), a(n+1) = number of prior terms a(j) > a(n), 1 <= j <= n-1. If a(n) is a repeat of a term last seen at a(m), m < n, then a(n+1) = n-m-1.

Table of values

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

List of values

[1, 0, 1, 1, 0, 2, 0, 1, 3, 0, 2, 4, 0, 2, 2, 0, 2, 1, 9, 0, 3, 11, 0, 2, 6, 2, 1, 8, 2, 2, 0, 7, 3, 11, 11, 0, 4, 24, 0, 2, 9, 21, 1, 15, 2, 4, 8, 18, 2, 3, 16, 3, 1, 9, 12, 5, 16, 5, 1, 5, 1, 1, 0, 23, 1, 2, 16, 9, 13, 8, 22, 2, 5, 12, 18, 26, 0, 13, 8, 8, 0]