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.

A280444 Least positive integer m such that n - p(m) = x*(3x-1)/2 + y*(3y+1)/2 for some nonnegative integers x and y, or 0 if no such m exists, where p(.) is the partition function given by A000041.

Table of values

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

List of values

[1, 1, 1, 1, 2, 1, 2, 1, 1, 2, 3, 4, 1, 2, 1, 1, 1, 2, 3, 1, 1, 2, 1, 2, 1, 2, 1, 1, 2, 1, 2, 1, 2, 3, 6, 1, 2, 1, 1, 2, 1, 1, 1, 2, 3, 1, 2, 3, 1, 2, 1, 1, 1, 1, 2, 3, 4, 1, 1, 2, 3, 1, 1, 2, 3, 4, 1, 2, 3, 1, 1, 2, 1, 2, 3, 1, 2, 1, 1, 1]