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.

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

List of values

[1, 1, 4, 2, 1, 3, 3, 4, 4, 9, 3, 3, 16, 4, 4, 25, 5, 1, 4, 24, 6, 1, 5, 10, 2, 2, 9, 6, 4, 14, 7, 1, 6, 18, 3, 5, 15, 3, 6, 24, 8, 2, 4, 32, 8, 2, 10, 10, 9, 9, 16, 8, 6, 15, 10, 8, 16, 12, 3, 7, 14, 4, 18, 18, 9, 15, 15, 16, 16, 25, 10, 10, 36, 6, 6, 49, 7, 3]