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.

A364341 a(n) is the greatest k such that there are exactly n distinct numbers j that can be expressed as the sum of two squares with k^2 < j < (k+1)^2, or -1 if such a k does not exist.

Table of values

n a(n)
0 0
1 1
2 3
3 4
4 6
5 7
6 11
7 10
8 14
9 12
10 16
11 20
12 22
13 23
14 21
15 27
16 29
17 30
18 32
19 35
20 38
21 37
22 42
23 44
24 47
25 43
26 54
27 52
28 51
29 58
30 57
31 62
32 56
33 71
34 64
35 67
36 68
37 73
38 76
39 77
40 78
41 83
42 72
43 87
44 90
45 91
46 -1
47 95
48 103
49 100
50 107
51 109
52 105
53 104
54 108
55 -1
56 116
57 119
58 110
59 129
60 117
61 126
62 -1
63 128
64 134

List of values

[0, 1, 3, 4, 6, 7, 11, 10, 14, 12, 16, 20, 22, 23, 21, 27, 29, 30, 32, 35, 38, 37, 42, 44, 47, 43, 54, 52, 51, 58, 57, 62, 56, 71, 64, 67, 68, 73, 76, 77, 78, 83, 72, 87, 90, 91, -1, 95, 103, 100, 107, 109, 105, 104, 108, -1, 116, 119, 110, 129, 117, 126, -1, 128, 134]