Event Dime
Mulatu Polynomials and an Efficient Detection Algorithm for Mulatu Numbers [version 1; peer review: awaiting peer review]
Education & Learning
- When:
- May 14, 2026 · 1:09 PM
- Source:
- F1000Research
Background Linear recurrence sequences have been extensively studied in number theory and combinatory, with the Fibonacci sequence being the most classical example. Recent research has expanded to include various generalizations such as k-Fibonacci sequences 1 Cullen sequences 2 and polynomial extensions [see 3,4 ]. Among these, Mulatu numbers, introduced by Mulatu Lemma 5 and defined by the recurrence: M n = M n − 1 + M n − 2, M 0 = 4, M 1 = 1, have emerged as an interesting variant with unique