**C(2n+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.**

*1, 3, 10, 35, 126, 462, 1716, 6435, 24310, 92378, 352716, 1352078, 5200300*

*9 seqfan posts*

*Sun Mar 11 18:30:31 CET 2012* [seqfan] Re: additions for completeness' sake

*Sun Mar 11 14:42:56 CET 2012* [seqfan] Re: additions for completeness' sake

*Sun Mar 11 14:12:52 CET 2012* [seqfan] additions for completeness' sake

*Sat Dec 4 13:07:56 CET 2010* [seqfan] Re: useless references?

*Sat Dec 4 11:56:09 CET 2010* [seqfan] useless references?

*Sun Sep 5 17:09:05 CEST 2010* [seqfan] Re: A misprint in formula for A001791

*Sun Apr 4 06:43:01 CEST 2010* [seqfan] Re:Riordan's classical formula and Juric's calculations

*Sun Apr 4 06:33:09 CEST 2010* [seqfan] Riordan's classical formula and Juric's calculations

*Fri Apr 2 09:53:53 CEST 2010* [seqfan] Riordan's classical formula and Juric's calculations

Index of A-numbers in seqfan: by ascending order
by month
by frequency
by keyword

Links to OEIS content are included according to
The OEIS End-User License Agreement
.