戴克编号,II。OEIS中的三元组和有根树A036991
Dyck Numbers, II. Triplets and Rooted Trees in OEIS A036991
摘要:
戴克路径是研究最多的加泰罗尼亚族之一。本文是[2]的继续。本文讨论了Dyck路的编号问题,即OEIS序列A036991或Dyck数的项。我们考虑形式为(t-4,t-2,t)的项的三元组(t是高级项);三元组覆盖A036991的80%。三元组包括所有的梅森数,每个梅森数都是某个三元组中的高级项。三元组分布在A036991范围内;范围的长度和范围内三元组的数量都由OEIS序列A001405的项计数。除了三联体,在范围内还有许多单独的术语,这些术语由OEIS序列A116385的术语计数。每一个单独的项(有无限多的项)都是一个无限三元组的三元树的根。结果,序列A036991是这样的有向树的森林。我们在A036991的无限三叉树上检验孪生素数猜想。我们考虑相差不超过4的素数对的无穷大定理。
英文摘要:
Dyck paths are among the most heavily studied Catalan families. This paper is a continuation of [2]. In the paper we are dealing with the numbering of Dyck paths, the terms of the OEIS sequence A036991 or Dyck numbers. We consider triplets of terms of the form (t-4, t-2, t) (t is the senior term); triplets cover 80% of A036991. Triplets include all Mersenne numbers, with each Mersenne number being a senior term in some triplet. Triples are distributed over A036991 ranges; both the length of the ranges and the number of triplets in the range are counted by the terms of the OEIS sequence A001405. In addition to triplets, there are many lone terms in the ranges, which are counted by the terms of the OEIS sequence A116385. Each lone term (there are an infinite number of them) is the root of an infinite ternary tree of triplets. As a result, the sequence A036991 is a forest of such directed trees. We test the twin prime conjecture on infinite ternary trees of A036991. We consider the infinity theorem for pairs of prime numbers that differ by no more than 4.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。