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.

A254296 The number of partitions of n having the minimum number of summands such that all integers from 1 to n can be represented as the sum of the summands times one of {-1, 0, 1}.

Table of values

n a(n)
1 1
2 1
3 1
4 1
5 2
6 2
7 3
8 2
9 2
10 2
11 1
12 1
13 1
14 10
15 11
16 12
17 11
18 12
19 12
20 11
21 11
22 12
23 9
24 9
25 9
26 7
27 7
28 7
29 5
30 5
31 5
32 3
33 3
34 3
35 2
36 2
37 2
38 1
39 1
40 1
41 131
42 136
43 140
44 133
45 137
46 140
47 133
48 136
49 138
50 129
51 131
52 134
53 125
54 126
55 128
56 117
57 119
58 120
59 109
60 110
61 111
62 101
63 102
64 102
65 92
66 92
67 93
68 81
69 81
70 81
71 72
72 72
73 72
74 63
75 63
76 63
77 54
78 54
79 54
80 47
81 47
82 47
83 40
84 40
85 40
86 33
87 33
88 33

List of values

[1, 1, 1, 1, 2, 2, 3, 2, 2, 2, 1, 1, 1, 10, 11, 12, 11, 12, 12, 11, 11, 12, 9, 9, 9, 7, 7, 7, 5, 5, 5, 3, 3, 3, 2, 2, 2, 1, 1, 1, 131, 136, 140, 133, 137, 140, 133, 136, 138, 129, 131, 134, 125, 126, 128, 117, 119, 120, 109, 110, 111, 101, 102, 102, 92, 92, 93, 81, 81, 81, 72, 72, 72, 63, 63, 63, 54, 54, 54, 47, 47, 47, 40, 40, 40, 33, 33, 33]