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.

A280455 Number of ways to write n as x*(3x-1)/2 + y*(3y+1)/2 + p(z), where x,y,z are nonnegative integers with z > 0, and p(.) is the partition function given by A000041.

Table of values

n a(n)
1 1
2 2
3 3
4 3
5 3
6 3
7 3
8 5
9 4
10 5
11 2
12 4
13 4
14 5
15 5
16 4
17 6
18 5
19 5
20 3
21 4
22 6
23 7
24 3
25 5
26 3
27 8
28 3
29 8
30 7
31 6
32 5
33 4
34 7
35 3
36 4
37 6
38 8
39 4
40 5
41 4
42 12
43 5
44 8
45 5
46 6
47 4
48 5
49 8
50 5
51 4
52 7
53 7
54 6
55 5
56 7
57 8
58 5
59 9
60 6
61 6
62 5
63 10
64 8
65 6
66 3
67 7
68 8
69 7
70 4
71 6
72 7
73 9
74 3
75 5
76 4
77 8
78 7
79 9
80 13

List of values

[1, 2, 3, 3, 3, 3, 3, 5, 4, 5, 2, 4, 4, 5, 5, 4, 6, 5, 5, 3, 4, 6, 7, 3, 5, 3, 8, 3, 8, 7, 6, 5, 4, 7, 3, 4, 6, 8, 4, 5, 4, 12, 5, 8, 5, 6, 4, 5, 8, 5, 4, 7, 7, 6, 5, 7, 8, 5, 9, 6, 6, 5, 10, 8, 6, 3, 7, 8, 7, 4, 6, 7, 9, 3, 5, 4, 8, 7, 9, 13]