marcipan5000's blog

By marcipan5000, history, 7 months ago, In English

Hi everyone,

In last educational round, I've stumbled upon a sequence as follows: 0,4,84,144,24. As it later turned out, this sequence (sometimes refered to as triangle read by rows, T(n,k)) was rather important, and not so easy to compute (for me, it required modular inversion for big numbers). It's in connection with Stirling numbers of the 2nd kind (i've included an image of the formula), and it got me thinking: aside from very basic sequences (like Catalan numbers, binomials or Fibonnacci), what enumerative combinatorical task solutions and ideas (of any difficulty) are must-known for competitive programming?

Marci

 
 
 
 
  • Vote: I like it
  • 0
  • Vote: I do not like it

»
6 weeks ago, # |
  Vote: I like it 0 Vote: I do not like it

Auto comment: topic has been updated by marcipan5000 (previous revision, new revision, compare).

»
6 weeks ago, # |
  Vote: I like it 0 Vote: I do not like it

Whenever I encounter a sequence, I usually use this website to search up a sequence.