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.

A345471 a(0) = a(1) = 1, a(n) is the smallest positive integer m >= a(n-1) + a(n-2) such that gcd(a(k),m) = 1 for all 1 < k <= n - 1.

Table of values

n a(n)
0 1
1 1
2 2
3 3
4 5
5 11
6 17
7 29
8 47
9 79
10 127
11 211
12 343
13 557
14 907
15 1469
16 2377
17 3847
18 6229
19 10079
20 16319
21 26399
22 42719
23 69119
24 111841
25 180967
26 292811
27 473779
28 766607
29 1240387
30 2006999
31 3247393
32 5254397
33 8501791
34 13756189
35 22258001
36 36014191
37 58272197
38 94286389
39 152558587

List of values

[1, 1, 2, 3, 5, 11, 17, 29, 47, 79, 127, 211, 343, 557, 907, 1469, 2377, 3847, 6229, 10079, 16319, 26399, 42719, 69119, 111841, 180967, 292811, 473779, 766607, 1240387, 2006999, 3247393, 5254397, 8501791, 13756189, 22258001, 36014191, 58272197, 94286389, 152558587]