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.

A306246 a(1) = 1, a(2) = 2, and for any n > 2, a(n) = o(n-1) + o(n-2) where o(k) is the number of occurrences of a(k) among a(1), ..., a(k).

Table of values

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

List of values

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