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.

A090631 Given n boxes labeled 1..n, such that box i weighs 2i 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 4
3 6
4 9
5 12
6 17
7 22
8 29
9 36
10 45
11 54
12 66
13 78
14 93
15 108
16 126
17 144
18 167
19 190
20 218
21 246
22 279
23 312
24 352
25 392
26 439
27 486
28 540
29 594
30 657
31 720
32 792
33 864
34 945
35 1026
36 1119
37 1212
38 1317
39 1422
40 1539
41 1656
42 1788
43 1920
44 2067
45 2214
46 2376
47 2538
48 2718
49 2898
50 3096
51 3294

List of values

[1, 2, 4, 6, 9, 12, 17, 22, 29, 36, 45, 54, 66, 78, 93, 108, 126, 144, 167, 190, 218, 246, 279, 312, 352, 392, 439, 486, 540, 594, 657, 720, 792, 864, 945, 1026, 1119, 1212, 1317, 1422, 1539, 1656, 1788, 1920, 2067, 2214, 2376, 2538, 2718, 2898, 3096, 3294]