Mathematics Stack Exchange is a question and answer site for people studying math at any level and professionals in related fields. It's 100% free, no registration required.

Sign up
Here's how it works:
  1. Anybody can ask a question
  2. Anybody can answer
  3. The best answers are voted up and rise to the top

I've been looking in vain (most books I came across give identities involving sums or recurrence relations, but do not give much attention to fixed values) for a reference to the following identity: $$S(n,n-3)={n \choose 2}{n \choose 4},$$ where $S(n,k)$ is the unsigned Stirling number of the first kind. Is this well-known, or too trivial to be mentioned anywhere?

share|cite|improve this question
It's not trivial, but the constant, 3, is just big enough not to be important enough to be even an exercise in a text. But it's perfect for OEIS as noted below. – Mitch Mar 2 '11 at 13:53
up vote 5 down vote accepted

The identity and the proof for the identity are there in the wiki link you have sent.

share|cite|improve this answer
Oh hell, so much for being careful. I must have missed it the last time I actually visited the page. Thanks. – Anthony Labarre Mar 2 '11 at 9:18
Also noted at OEIS A001303 which has other formulae and several references to the sequence – Henry Mar 2 '11 at 10:46

Your Answer


By posting your answer, you agree to the privacy policy and terms of service.

Not the answer you're looking for? Browse other questions tagged or ask your own question.