CatLikeLemming@lemmy.blahaj.zone to 196@lemmy.blahaj.zoneEnglish · 8 hours agoDoomscrolling doesn't rulelemmy.blahaj.zoneimagemessage-square8linkfedilinkarrow-up1137
arrow-up1137imageDoomscrolling doesn't rulelemmy.blahaj.zoneCatLikeLemming@lemmy.blahaj.zone to 196@lemmy.blahaj.zoneEnglish · 8 hours agomessage-square8linkfedilink
minus-squareCobblerScholar@lemmy.worldlinkfedilinkEnglisharrow-up9·7 hours agoJust 1, 3, 10 more posts and then I’ll stop
minus-squareFilthyShrooms@lemmy.worldlinkfedilinkEnglisharrow-up15·7 hours ago99% of doomscrollers stop scrolling right before seeing the perfect post
minus-squarealiceitc@lemmy.blahaj.zonelinkfedilinkEnglisharrow-up4·7 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.
Just 1, 3, 10 more posts and then I’ll stop
99% of doomscrollers stop scrolling right before seeing the perfect post
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.