

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.


4



1, 2, 6, 24, 119, 702, 4795, 37183, 322486, 3091630, 32453172, 370104159, 4555518746, 60182704891, 849245520581, 12746759647944, 202753756944382, 3406596290534764, 60282041591986049, 1120554350714688130
(list;
graph;
refs;
listen;
history;
text;
internal format)



OFFSET

1,2


COMMENTS

If each box may contain at most one (possibly nested) box then the Bell numbers (A000110) are obtained, whereas if each box may contain at most two smaller (possibly nested) boxes then A000772 is obtained and if no restriction is placed on the number of (possible nested) boxes that any box may contain then the factorial numbers (A000142) are obtained. Sequence suggested by an earlier submission of Rick L. Shepherd.


LINKS

Table of n, a(n) for n=1..20.


FORMULA

E. g. f. = exp(G(x)  1), where G(x) be the function that satisfies 6G'(x) = G(x)^3 + 3G(x) + 2 and G(0) = 1. (In this case G'(x) is the exponential generating function giving the number of ways to perform the given task if at most 3 boxes may fail to lie in another box.) [From Joel B. Lewis, Apr 28 2009]
a(n) = D^n(exp(x)) evaluated at x = 0, where D is the operator (1+x+x^2/2!+x^3/3!)*d/dx. Cf. A000110 and A000772.  Peter Bala, Nov 25 2011


EXAMPLE

a(3)=6, as seen from these arrangements: 112233, 321123, 311223, 211233, 223113, 113223, where xyyx indicates that box x contains box y, etc.


CROSSREFS

Cf. A000110, A000142, A000772.
Sequence in context: A256207 A256208 A264432 * A071077 A202213 A202216
Adjacent sequences: A094195 A094196 A094197 * A094199 A094200 A094201


KEYWORD

nonn


AUTHOR

John W. Layman, May 25 2004


STATUS

approved



