A019581 - cp's OEIS frontend

A019581 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 f(n,2).

n	a(n)
1	0
2	2
3	18
4	180
5	2100
6	28800
7	458640
8	8361360
9	172141200
10	3954484800
11	100330876800
12	2786980996800
13	84133667217600
14	2742770705875200
15	96032990237184000
16	3594185336405664000
17	143193231131382432000
18	6050494745192177280000
19	270263142944131873536000

[0, 2, 18, 180, 2100, 28800, 458640, 8361360, 172141200, 3954484800, 100330876800, 2786980996800, 84133667217600, 2742770705875200, 96032990237184000, 3594185336405664000, 143193231131382432000, 6050494745192177280000, 270263142944131873536000]

cp's OEIS Frontend

A019581 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 f(n,2).

Table of values

List of values