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.

A161759 n occurs n times, as early as possible subject to the constraint that two successive occurrences of n are separated by exactly 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 14
11 3
12 5
13 19
14 4
15 6
16 21
17 9
18 5
19 4
20 40
21 54
22 6
23 79
24 5
25 14
26 7
27 9
28 69
29 6
30 5
31 146
32 74
33 19
34 7
35 89
36 6
37 9
38 21
39 29
40 14
41 164
42 7
43 6
44 99
45 104
46 230
47 9
48 188
49 209
50 7
51 335
52 529
53 19
54 139
55 14
56 329
57 9
58 7
59 149
60 21
61 40
62 750
63 559
64 174
65 44
66 7
67 9
68 349
69 29
70 14
71 999
72 1273
73 19
74 7

List of values

[1, 2, 3, 4, 2, 5, 3, 6, 4, 14, 3, 5, 19, 4, 6, 21, 9, 5, 4, 40, 54, 6, 79, 5, 14, 7, 9, 69, 6, 5, 146, 74, 19, 7, 89, 6, 9, 21, 29, 14, 164, 7, 6, 99, 104, 230, 9, 188, 209, 7, 335, 529, 19, 139, 14, 329, 9, 7, 149, 21, 40, 750, 559, 174, 44, 7, 9, 349, 29, 14, 999, 1273, 19, 7]