A160663 - cp's OEIS frontend

A160663 Number of distinct sums that one can obtain by adding two squares among the n first ones.

n	a(n)
1	2
2	5
3	9
4	14
5	19
6	26
7	33
8	41
9	50
10	60
11	70
12	82
13	93
14	105
15	119
16	134
17	147
18	164
19	179
20	197
21	215
22	234
23	251
24	272
25	293
26	314
27	336
28	359
29	381
30	407
31	430
32	456
33	483
34	507
35	535
36	566
37	594
38	623
39	652
40	686
41	714
42	748
43	780
44	812
45	849
46	883
47	918
48	956
49	992
50	1030
51	1068
52	1107
53	1141
54	1181

[2, 5, 9, 14, 19, 26, 33, 41, 50, 60, 70, 82, 93, 105, 119, 134, 147, 164, 179, 197, 215, 234, 251, 272, 293, 314, 336, 359, 381, 407, 430, 456, 483, 507, 535, 566, 594, 623, 652, 686, 714, 748, 780, 812, 849, 883, 918, 956, 992, 1030, 1068, 1107, 1141, 1181]

cp's OEIS Frontend

A160663 Number of distinct sums that one can obtain by adding two squares among the n first ones.

Table of values

List of values