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.

A364969 a(n) = a(a(n-1)) if n is even, a(n) is the number of times a(n-1) occurs in the sequence so far if n is odd, with a(1) = 1.

Table of values

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

List of values

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