login

Year-end appeal: Please make a donation to the OEIS Foundation to support ongoing development and maintenance of the OEIS. We are now in our 61st year, we have over 378,000 sequences, and we’ve reached 11,000 citations (which often say “discovered thanks to the OEIS”).

A105344
Number of ways of placing n balls into n boxes and then into n containers.
0
OFFSET
1,2
EXAMPLE
a(2): We can have either 2 balls in a box and the other box empty, or a ball in each box. We may place both the boxes into one container, or one in each.
So we have [(2)()][], [(1)(1)][], [(2)][()] and [(1)][(1)], hence a(2)=4.
For a(3) we have: (0 is an empty box, / is a new container, - is an empty container)
300/-/-, 30/0/-, 3/00/-, 3/0/0
210/-/-, 21/0/-, 20/1/-, 2/10/-, 2/1/0
111/-/-, 11/1/-, 1/1/1
total 12
CROSSREFS
Cf. A000041.
Sequence in context: A065143 A098543 A028407 * A074035 A149366 A370540
KEYWORD
nonn
AUTHOR
Jon Perry, Apr 30 2005
STATUS
approved