A019575 - cp's OEIS frontend

A019575 Place n distinguishable balls in n boxes (in n^n ways); let T(n,k) = number of ways that the maximum in any box is k, for 1 <= k <= n; sequence gives triangle of numbers T(n,k).

n	a(n)
1	1
2	2
3	2
4	6
5	18
6	3
7	24
8	180
9	48
10	4
11	120
12	2100
13	800
14	100
15	5
16	720
17	28800
18	14700
19	2250
20	180
21	6
22	5040
23	458640
24	301350
25	52920
26	5292
27	294
28	7
29	40320
30	8361360
31	6867840
32	1342600
33	153664
34	10976
35	448
36	8
37	362880
38	172141200
39	172872000
40	36991080
41	4644864
42	387072
43	20736
44	648
45	9

[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, 20736, 648, 9]

cp's OEIS Frontend

A019575 Place n distinguishable balls in n boxes (in n^n ways); let T(n,k) = number of ways that the maximum in any box is k, for 1 <= k <= n; sequence gives triangle of numbers T(n,k).

Table of values

List of values