[seqfan] Counting permutations

Charles Greathouse charles.greathouse at case.edu
Fri Nov 4 17:53:47 CET 2011

I can't find a sequence that shows the number f(m, n) of ways to
choose numbers from 1, 2, ..., m with a sum of at most n.  Is this
already in the OEIS?  I tried searching for it as a triangle possibly
missing some columns, but couldn't find it.  I suppose it could also
be thought of as a rectangular array to be read by antidiagonals.

(Generally it's hard to search for two-dimensional entities in the
OEIS; I wonder if there's a good general solution.)

Charles Greathouse
Case Western Reserve University

More information about the SeqFan mailing list