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.

A281229 Smallest number k of the form x^2 + y^2 with 0 <= x <= y such that gcd(x, y) = 1, x + y = n, and k has no other decompositions into a sum of two squares.

Table of values

n a(n)
1 1
2 2
3 5
4 10
5 13
6 26
7 29
8 34
9 41
10 58
11 61
12 74
13 89
14 106
15 113
16 146
17 149
18 194
19 181
20 202
21 233
22 274
23 269
24 386
25 313
26 346
27 389
28 394
29 421
30 458
31 521
32 514
33 557
34 586
35 613
36 698
37 709
38 794
39 761
40 802
41 853
42 914
43 929
44 1018
45 1013
46 1186
47 1109
48 1154
49 1201
50 1282
51 1301
52 1354
53 1409

List of values

[1, 2, 5, 10, 13, 26, 29, 34, 41, 58, 61, 74, 89, 106, 113, 146, 149, 194, 181, 202, 233, 274, 269, 386, 313, 346, 389, 394, 421, 458, 521, 514, 557, 586, 613, 698, 709, 794, 761, 802, 853, 914, 929, 1018, 1013, 1186, 1109, 1154, 1201, 1282, 1301, 1354, 1409]