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.

A329981 a(1) = 0, and for n > 0, a(n+1) = floor(k / 3) where k is the number of terms equal to a(n) among the first n terms.

Table of values

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

List of values

[0, 0, 0, 1, 0, 1, 0, 1, 1, 1, 1, 2, 0, 2, 0, 2, 1, 2, 1, 2, 1, 3, 0, 2, 2, 2, 2, 3, 0, 3, 1, 3, 1, 3, 1, 4, 0, 3, 2, 3, 2, 3, 2, 4, 0, 3, 3, 3, 3, 4, 1, 4, 1, 4, 1, 5, 0, 4, 2, 4, 2, 4, 2, 5, 0, 4, 3, 4, 3, 4, 3, 5, 1, 5, 1, 5, 1, 6, 0, 4, 4, 4, 4, 5, 2, 5, 2]