a(n) = binomial(2*n+1, n+1): number of ways to put n+1 indistinguishable balls into n+1 distinguishable boxes = number of (n+1)-st degree monomials in n+1 variables = number of monotone maps from 1..n+1 to 1..n+1.
A001700
a(n) = binomial(2*n+1, n+1): number of ways to put n+1 indistinguishable balls into n+1 distinguishable boxes = number of (n+1)-st degree monomials in n+1 variables = number of monotone maps from 1..n+1 to 1..n+1.
Terms
- a(0) =1a(1) =3a(2) =10a(3) =35a(4) =126a(5) =462a(6) =1716a(7) =6435a(8) =24310a(9) =92378a(10) =352716a(11) =1352078a(12) =5200300a(13) =20058300a(14) =77558760a(15) =300540195a(16) =1166803110a(17) =4537567650a(18) =17672631900a(19) =68923264410a(20) =269128937220
External references
- oeis: A001700