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.

A332301 a(1) = 1, a(2) = 2; for n > 2, a(n) is the smallest divisor of the sum of the previous two terms that has not yet appeared. If all divisors have appeared then a(n) equals the sum.

Table of values

n a(n)
1 1
2 2
3 3
4 5
5 4
6 9
7 13
8 11
9 6
10 17
11 23
12 8
13 31
14 39
15 7
16 46
17 53
18 33
19 43
20 19
21 62
22 27
23 89
24 29
25 59
26 22
27 81
28 103
29 92
30 15
31 107
32 61
33 12
34 73
35 85
36 79
37 41
38 10
39 51
40 61
41 14
42 25
43 39
44 16
45 55
46 71
47 18
48 89
49 107
50 28
51 45
52 73
53 118
54 191
55 309
56 20
57 47
58 67
59 38
60 21
61 59
62 40
63 99
64 139
65 34
66 173
67 69
68 121
69 95
70 24
71 119
72 143
73 131
74 137
75 134
76 271
77 135
78 58
79 193

List of values

[1, 2, 3, 5, 4, 9, 13, 11, 6, 17, 23, 8, 31, 39, 7, 46, 53, 33, 43, 19, 62, 27, 89, 29, 59, 22, 81, 103, 92, 15, 107, 61, 12, 73, 85, 79, 41, 10, 51, 61, 14, 25, 39, 16, 55, 71, 18, 89, 107, 28, 45, 73, 118, 191, 309, 20, 47, 67, 38, 21, 59, 40, 99, 139, 34, 173, 69, 121, 95, 24, 119, 143, 131, 137, 134, 271, 135, 58, 193]