• aliceitc@lemmy.blahaj.zone
    link
    fedilink
    English
    arrow-up
    3
    ·
    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.