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.

A066062 Number of subsets S of T={0,1,2,...,n} such that each element of T is the sum of two (not necessarily distinct) elements of S.

Table of values

n a(n)
0 1
1 1
2 2
3 3
4 6
5 10
6 20
7 37
8 73
9 139
10 275
11 533
12 1059
13 2075
14 4126
15 8134
16 16194
17 32058
18 63910
19 126932
20 253252
21 503933
22 1006056
23 2004838
24 4004124
25 7987149
26 15957964
27 31854676
28 63660327
29 127141415
30 254136782
31 507750109
32 1015059238
33 2028564292
34 4055812657
35 8107052520

List of values

[1, 1, 2, 3, 6, 10, 20, 37, 73, 139, 275, 533, 1059, 2075, 4126, 8134, 16194, 32058, 63910, 126932, 253252, 503933, 1006056, 2004838, 4004124, 7987149, 15957964, 31854676, 63660327, 127141415, 254136782, 507750109, 1015059238, 2028564292, 4055812657, 8107052520]