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.

A358444 a(1) = 1, a(2) = 2; for n > 2, a(n) = smallest positive number which has not appeared that has a common factor with a(n-2)^2 + a(n-1)^2.

Table of values

n a(n)
1 1
2 2
3 5
4 29
5 4
6 857
7 10
8 734549
9 539562233501
10 6
11 12433
12 15
13 8
14 17
15 353
16 12
17 124753
18 13
19 14
20 20
21 16
22 18
23 22
24 24
25 25
26 1201
27 26
28 41
29 2357
30 28
31 5556233
32 37
33 30
34 2269
35 39
36 32
37 35
38 52
39 3929
40 40
41 15438641
42 82
43 45
44 65
45 34
46 5381
47 78
48 50
49 36
50 38
51 42
52 44
53 46
54 48
55 51
56 3
57 9
58 21
59 27
60 33
61 54
62 55
63 91

List of values

[1, 2, 5, 29, 4, 857, 10, 734549, 539562233501, 6, 12433, 15, 8, 17, 353, 12, 124753, 13, 14, 20, 16, 18, 22, 24, 25, 1201, 26, 41, 2357, 28, 5556233, 37, 30, 2269, 39, 32, 35, 52, 3929, 40, 15438641, 82, 45, 65, 34, 5381, 78, 50, 36, 38, 42, 44, 46, 48, 51, 3, 9, 21, 27, 33, 54, 55, 91]