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.

A331165 a(n) = a(n-1) + p(n) if p(n) > a(n-1), otherwise a(n) = a(n-1) - p(n), where p is the partition function A000041 (assuming a(n) = 0 for n < 0).

Table of values

n a(n)
0 1
1 0
2 2
3 5
4 0
5 7
6 18
7 3
8 25
9 55
10 13
11 69
12 146
13 45
14 180
15 4
16 235
17 532
18 147
19 637
20 10
21 802
22 1804
23 549
24 2124
25 166
26 2602
27 5612
28 1894
29 6459
30 855
31 7697
32 16046
33 5903
34 18213
35 3330
36 21307
37 42944
38 16929
39 48114
40 10776
41 55359
42 2185
43 65446
44 140621
45 51487
46 157045
47 32291
48 179564

List of values

[1, 0, 2, 5, 0, 7, 18, 3, 25, 55, 13, 69, 146, 45, 180, 4, 235, 532, 147, 637, 10, 802, 1804, 549, 2124, 166, 2602, 5612, 1894, 6459, 855, 7697, 16046, 5903, 18213, 3330, 21307, 42944, 16929, 48114, 10776, 55359, 2185, 65446, 140621, 51487, 157045, 32291, 179564]