A383968 - cp's OEIS frontend

A383968 Number of distinct subsets S of [1..n] such that for all 1 <= k <= n, there exists two elements x,y in S (not necessarily distinct) such that x+y = 2k.

n	a(n)
1	1
2	1
3	2
4	3
5	5
6	9
7	17
8	30
9	58
10	107
11	205
12	392
13	768
14	1466
15	2883
16	5597
17	11038
18	21572
19	42675
20	83711
21	166371
22	327893
23	651199
24	1288480
25	2564032
26	5082878
27	10127472
28	20115845
29	40104636
30	79781149
31	159174500
32	316962113
33	632716744
34	1261189166
35	2518287361
36	5023170116
37	10034132101
38	20025033970

[1, 1, 2, 3, 5, 9, 17, 30, 58, 107, 205, 392, 768, 1466, 2883, 5597, 11038, 21572, 42675, 83711, 166371, 327893, 651199, 1288480, 2564032, 5082878, 10127472, 20115845, 40104636, 79781149, 159174500, 316962113, 632716744, 1261189166, 2518287361, 5023170116, 10034132101, 20025033970]

cp's OEIS Frontend

A383968 Number of distinct subsets S of [1..n] such that for all 1 <= k <= n, there exists two elements x,y in S (not necessarily distinct) such that x+y = 2k.

Table of values

List of values