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.

A382482 a(1) = 1. Let a(n) be the most recently defined term. At each step, check for an undefined term with index < n. If such a term exists, then where i is the earliest such index, set a(i) = a(n) - (n - i). If no such term exists, then where i is the first undefined index >= n + a(n), set a(i) = the smallest integer not yet used.

Table of values

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

List of values

[1, 2, 2, 3, 4, 2, 5, 6, 5, 5, 4, 7, 6, 5, 8, 9, 8, 5, 10, 11, 11, 4, 13, 13, 12, 15, 6, 12, 7, 13, 8, 14, 17, 16, 7, 19, 16, 19, 21, 18, 8, 23, 20, 20, 7, 21, 8, 22, 25, 22, 11, 27, 22, 11, 29, 24, 24, 12, 23, 14, 24, 31, 16, 26, 33, 26, 28, 16, 26, 30, 35]