A338921 - cp's OEIS frontend

A338921 a(0)=1, a(n) for n >= 1 is the number of distinct sums of two elements in [a(0), ..., a(n-1)], chosen without replacement.

n	a(n)
0	1
1	0
2	1
3	2
4	3
5	5
6	8
7	12
8	17
9	22
10	28
11	35
12	43
13	52
14	60
15	69
16	77
17	86
18	92
19	103
20	112
21	123
22	137
23	151
24	168
25	180
26	194
27	204
28	224
29	245
30	261
31	280
32	301
33	318
34	335
35	352
36	369
37	387
38	413
39	433
40	459
41	482
42	507
43	528
44	552
45	586
46	614
47	638
48	669
49	701
50	733
51	761
52	791
53	824
54	855
55	885
56	917
57	952
58	985
59	1020

[1, 0, 1, 2, 3, 5, 8, 12, 17, 22, 28, 35, 43, 52, 60, 69, 77, 86, 92, 103, 112, 123, 137, 151, 168, 180, 194, 204, 224, 245, 261, 280, 301, 318, 335, 352, 369, 387, 413, 433, 459, 482, 507, 528, 552, 586, 614, 638, 669, 701, 733, 761, 791, 824, 855, 885, 917, 952, 985, 1020]

cp's OEIS Frontend

A338921 a(0)=1, a(n) for n >= 1 is the number of distinct sums of two elements in [a(0), ..., a(n-1)], chosen without replacement.

Table of values

List of values