We present several computational results and
conjectures involving an Euler-Fibonacci sequence defined as follows: and thereafter. The term turns out to be even whenever while the inequality holds true for all n.
The computation of the first 500 terms of the Euler-Fibonacci sequence, with having 91 digits, suggests a series
of interesting questions concerning the congruence classes of modulo 4, and the behavior of the
consecutive quotients for