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.

A090632 Given n boxes labeled 1..n, such that box i weighs 3i grams and can support a total weight of i grams; a(n) = number of stacks of boxes that can be formed such that no box is squashed.

Table of values

n a(n)
0 1
1 2
2 3
3 5
4 7
5 9
6 12
7 15
8 18
9 22
10 26
11 30
12 36
13 42
14 48
15 56
16 64
17 72
18 82
19 92
20 102
21 114
22 126
23 138
24 153
25 168
26 183
27 201
28 219
29 237
30 258
31 279
32 300
33 324
34 348
35 372
36 400
37 428
38 456
39 488
40 520
41 552
42 588
43 624
44 660
45 700
46 740
47 780
48 826
49 872
50 918
51 970
52 1022
53 1074
54 1132
55 1190
56 1248

List of values

[1, 2, 3, 5, 7, 9, 12, 15, 18, 22, 26, 30, 36, 42, 48, 56, 64, 72, 82, 92, 102, 114, 126, 138, 153, 168, 183, 201, 219, 237, 258, 279, 300, 324, 348, 372, 400, 428, 456, 488, 520, 552, 588, 624, 660, 700, 740, 780, 826, 872, 918, 970, 1022, 1074, 1132, 1190, 1248]