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.

A363763 a(n) is the least 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 2
3 4
4 5
5 7
6 8
7 10
8 13
9 12
10 15
11 17
12 19
13 23
14 21
15 24
16 25
17 28
18 32
19 31
20 34
21 37
22 39
23 44
24 41
25 43
26 45
27 50
28 51
29 48
30 57
31 55
32 56
33 59
34 64
35 63
36 68
37 69
38 74
39 77
40 78
41 75
42 72
43 80
44 88
45 84
46 -1
47 94
48 89
49 96
50 93
51 99
52 97
53 102
54 108
55 -1
56 106
57 111
58 110
59 113
60 117
61 120
62 -1
63 123
64 133
65 127
66 130
67 137
68 142
69 138
70 139
71 -1
72 135

List of values

[0, 1, 2, 4, 5, 7, 8, 10, 13, 12, 15, 17, 19, 23, 21, 24, 25, 28, 32, 31, 34, 37, 39, 44, 41, 43, 45, 50, 51, 48, 57, 55, 56, 59, 64, 63, 68, 69, 74, 77, 78, 75, 72, 80, 88, 84, -1, 94, 89, 96, 93, 99, 97, 102, 108, -1, 106, 111, 110, 113, 117, 120, -1, 123, 133, 127, 130, 137, 142, 138, 139, -1, 135]