Stanley's children's game. Class of n (named) children forms into rings with exactly one child inside each ring. We allow the case when outer ring has only one child. a(n) gives number of possibilities, including clockwise order (or which hand is held), in each ring.
A066166
Stanley's children's game. Class of n (named) children forms into rings with exactly one child inside each ring. We allow the case when outer ring has only one child. a(n) gives number of possibilities, including clockwise order (or which hand is held), in each ring.
Terms
- a(0) =2a(1) =3a(2) =20a(3) =90a(4) =594a(5) =4200a(6) =34544a(7) =316008a(8) =3207240a(9) =35699400a(10) =432690312a(11) =5672581200a(12) =79991160144
External references
- oeis: A066166