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.

A316774 a(n) = n for n < 2, a(n) = freq(a(n-1),n) + freq(a(n-2),n) for n >= 2, where freq(i,j) is the number of times i appears in [a(0),a(1),...,a(j-1)].

Table of values

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

List of values

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