For n ≥ 4, the Frobenius number of ⟨f_n², f_{n+1}², f_{n+2}²⟩ is given by one of three explicit formulas depending on n mod 3.
Title resolution pending
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
math.NT 1years
2025 1verdicts
CONDITIONAL 1representative citing papers
citing papers explorer
-
The Frobenius number corresponding to the squares of three consecutive Fibonacci numbers: comparison of three algorithmic processes
For n ≥ 4, the Frobenius number of ⟨f_n², f_{n+1}², f_{n+2}²⟩ is given by one of three explicit formulas depending on n mod 3.