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.

A265853 a(0)=1; for n >= 1, a(n) is the number of subsets of [a(0), a(1), ..., a(n-1)] whose sum is equal to a(n-1).

Table of values

n a(n)
0 1
1 1
2 2
3 2
4 3
5 5
6 6
7 8
8 11
9 17
10 25
11 33
12 41
13 52
14 80
15 139
16 204
17 245
18 289
19 410
20 692
21 1159
22 1477
23 2010
24 2769
25 4247
26 6128
27 7709
28 9817
29 14071
30 21982
31 34892
32 52079
33 63998
34 81167
35 122709
36 183662
37 267520
38 382690
39 521361
40 725601
41 1050579
42 1541163
43 2084690
44 2829408

List of values

[1, 1, 2, 2, 3, 5, 6, 8, 11, 17, 25, 33, 41, 52, 80, 139, 204, 245, 289, 410, 692, 1159, 1477, 2010, 2769, 4247, 6128, 7709, 9817, 14071, 21982, 34892, 52079, 63998, 81167, 122709, 183662, 267520, 382690, 521361, 725601, 1050579, 1541163, 2084690, 2829408]