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.

A301469 Signed recurrence over enriched r-trees: a(n) = 2 * (-1)^n + Sum_y Product_{i in y} a(y) where the sum is over all integer partitions of n - 1.

Table of values

n a(n)
0 2
1 -1
2 1
3 0
4 0
5 1
6 0
7 1
8 1
9 1
10 2
11 3
12 3
13 6
14 7
15 11
16 17
17 23
18 35
19 53
20 75
21 119
22 173
23 264
24 398
25 603
26 911
27 1411
28 2114
29 3279
30 4977
31 7696
32 11760
33 18253
34 27909
35 43451
36 66675
37 103945
38 160096
39 249904
40 385876
41 603107
42 933474
43 1461967
44 2266384
45 3553167
46 5521053
47 8664117
48 13485744

List of values

[2, -1, 1, 0, 0, 1, 0, 1, 1, 1, 2, 3, 3, 6, 7, 11, 17, 23, 35, 53, 75, 119, 173, 264, 398, 603, 911, 1411, 2114, 3279, 4977, 7696, 11760, 18253, 27909, 43451, 66675, 103945, 160096, 249904, 385876, 603107, 933474, 1461967, 2266384, 3553167, 5521053, 8664117, 13485744]