The Frobenius number corresponding to the squares of three consecutive Fibonacci numbers: comparison of three algorithmic processes

We compute the Frobenius number for numerical semigroups generated by the squares of three consecutive Fibonacci numbers. We achieve this by using and comparing three distinct algorithmic approaches: those developed by Ramírez Alfonsín and Rødseth ([15]), Rosales and García-Sánchez ([20]), and Tripathi ([26]).