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.

A100798 n occurs n times, as early as possible subject to the constraint that two successive occurrences of n are separated by at least by n terms.

Table of values

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

List of values

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