Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A105344
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A105344 Number of ways of placing n balls into n boxes and then into n containers. +0
1
1, 4, 12, 45 (list; graph; listen)
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 this_sequence A074035 A149366 A149367

Adjacent sequences: A105341 A105342 A105343 this_sequence A105345 A105346 A105347

KEYWORD

nonn

AUTHOR

Jon Perry (perry(AT)globalnet.co.uk), Apr 30 2005

page 1

Search completed in 0.002 seconds

Lookup | Welcome | Find friends | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Transforms | Puzzles | Hot | Classics
More pages | Superseeker | Maintained by N. J. A. Sloane (njas@research.att.com)

Last modified December 7 23:50 EST 2009. Contains 170430 sequences.


AT&T Labs Research