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.

A357943 a(0) = 0; a(1) = 1, a(2) = 2; for n > 2, a(n) is the number of times the term a(n - 1 - a(n-1)) has appeared in the sequence.

Table of values

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

List of values

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