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.

A350768 a(1)=1. Thereafter, if a(n) is a term that has appeared exactly k times prior to and including itself then a(n+1) is the number of terms prior to and including a(n) which have appeared exactly k times.

Table of values

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

List of values

[1, 1, 2, 1, 3, 2, 2, 6, 2, 4, 3, 2, 5, 3, 6, 2, 6, 9, 3, 4, 2, 7, 3, 5, 4, 9, 4, 4, 10, 2, 8, 3, 6, 4, 12, 4, 7, 6, 5, 6, 12, 6, 14, 3, 21, 4, 16, 5, 4, 9, 6, 16, 6, 18, 5, 5, 6, 10, 8, 10, 9, 4, 20, 4, 11, 5, 14, 10, 8, 6, 22, 5, 16, 9, 5, 9, 6, 12, 12, 8, 12]