科研之友
微信
新浪微博
Facebook
分享链接
摘要
We introduce a simple equivalence relation on ordered rooted tree graphs. As a consequence we show that (n(0) + n(1) + n(2) + ... + n(m) - 1)!/n(0)!n(1)!n(2)!...n(m)! is divisible by , where are nonnegative integers such that . There is at least one such that is an odd positive integer, and for every divisor of every where and , there is at least one which is not divisible by . In particular, it follows that , where is an odd integer such that is not divisible by 3 and denotes the th Catalan number.
- 出版日期2015-6
