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.

A094198 Number of ways that n boxes with distinct sizes can contain each other under the condition that each box may contain at most three (themselves possibly nested) boxes. Each box is assumed to be large enough to contain any three smaller boxes.

Table of values

n a(n)
1 1
2 2
3 6
4 24
5 119
6 702
7 4795
8 37183
9 322486
10 3091630
11 32453172
12 370104159
13 4555518746
14 60182704891
15 849245520581
16 12746759647944
17 202753756944382
18 3406596290534764
19 60282041591986049
20 1120554350714688128

List of values

[1, 2, 6, 24, 119, 702, 4795, 37183, 322486, 3091630, 32453172, 370104159, 4555518746, 60182704891, 849245520581, 12746759647944, 202753756944382, 3406596290534764, 60282041591986049, 1120554350714688128]