|
Search: id:A019575
|
|
|
| A019575 |
|
Place n distinguishable balls in n boxes (in n^n ways); let T(n,k) = number of ways that max in any box is k, for 1<=k<=n; sequence gives triangle of numbers T(n,k). |
|
+0
4
|
|
| 1, 2, 2, 6, 18, 3, 24, 180, 48, 4, 120, 2100, 800, 100, 5, 720, 28800, 14700, 2250, 180, 6, 5040, 458640, 301350, 52920, 5292, 294, 7, 40320, 8361360, 6867840, 1342600, 153664, 10976, 448, 8, 362880, 172141200, 172872000, 36991080, 4644864, 387072
(list; table; graph; listen)
|
|
|
OFFSET
|
1,2
|
|
|
FORMULA
|
A019575(x, z) = Sum ( A049009(p)) where x = A036042(p), z = A049085(p) - Alford Arnold (Alford1940(AT)AOL.com).
|
|
EXAMPLE
|
1; 2,2; 6,18,3; 24,180,48,4; ...
|
|
CROSSREFS
|
Cf. A019576.
Sequence in context: A062833 A006250 A006249 this_sequence A138800 A103179 A004077
Adjacent sequences: A019572 A019573 A019574 this_sequence A019576 A019577 A019578
|
|
KEYWORD
|
nonn,tabl,easy,nice
|
|
AUTHOR
|
Lee Corbin (lcorbin(AT)tsoft.com)
|
|
|
Search completed in 0.002 seconds
|
