CatLikeLemming@lemmy.blahaj.zone to 196@lemmy.blahaj.zoneEnglish · 7 hours agoDoomscrolling doesn't rulelemmy.blahaj.zoneimagemessage-square7linkfedilinkarrow-up1123
arrow-up1123imageDoomscrolling doesn't rulelemmy.blahaj.zoneCatLikeLemming@lemmy.blahaj.zone to 196@lemmy.blahaj.zoneEnglish · 7 hours agomessage-square7linkfedilink
minus-squarealiceitc@lemmy.blahaj.zonelinkfedilinkEnglisharrow-up3·5 hours ago 1, 3, 10 That’s a nice sequence! 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.
That’s a nice sequence!
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.