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.

A261604 a(1)=0. For n>1, a(n) = smallest number > a(n-1) such that, for all m,r a(n) != a(m)^2 + a(r)^2.

Table of values

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

List of values

[0, 1, 3, 4, 5, 6, 7, 8, 11, 12, 13, 14, 15, 19, 20, 21, 22, 23, 24, 27, 28, 29, 30, 31, 33, 35, 38, 39, 40, 42, 43, 44, 46, 47, 48, 51, 53, 54, 55, 56, 57, 59, 60, 62, 63, 66, 67, 68, 69, 70, 71, 75, 76, 77, 78, 79, 81, 82, 83, 84, 86, 87, 88]