数学
组合数学
序列(生物学)
离散数学
化学
生物化学
标识
DOI:10.1556/012.2019.56.3.1435
摘要
Abstract Let { P n } n ≥0 be the sequence of Padovan numbers defined by P 0 = 0, P 1 = 1, P 2 = 1, and P n +3 = P n +1 + P n for all n ≥ 0. In this paper, we find all integers c admitting at least two representations as a difference between a Padovan number and a power of 3.
科研通智能强力驱动
Strongly Powered by AbleSci AI