A019576 - cp's OEIS frontend

A019576 Place n distinguishable balls in n boxes (in n^n ways); let f(n,k) = number of ways that max in any box is k, for 1<=k<=n; sequence gives triangle of numbers f(n,k)/n.

n	a(n)
1	1
2	1
3	1
4	2
5	6
6	1
7	6
8	45
9	12
10	1
11	24
12	420
13	160
14	20
15	1
16	120
17	4800
18	2450
19	375
20	30
21	1
22	720
23	65520
24	43050
25	7560
26	756
27	42
28	1
29	5040
30	1045170
31	858480
32	167825
33	19208
34	1372
35	56
36	1
37	40320
38	19126800
39	19208000
40	4110120
41	516096
42	43008
43	2304
44	72
45	1

[1, 1, 1, 2, 6, 1, 6, 45, 12, 1, 24, 420, 160, 20, 1, 120, 4800, 2450, 375, 30, 1, 720, 65520, 43050, 7560, 756, 42, 1, 5040, 1045170, 858480, 167825, 19208, 1372, 56, 1, 40320, 19126800, 19208000, 4110120, 516096, 43008, 2304, 72, 1]

cp's OEIS Frontend

A019576 Place n distinguishable balls in n boxes (in n^n ways); let f(n,k) = number of ways that max in any box is k, for 1<=k<=n; sequence gives triangle of numbers f(n,k)/n.

Table of values

List of values