The random Fibonacci sequence and the Viswanath's constant

Random Fibonacci recursion 

https://en.wikipedia.org/wiki/Random_Fibonacci_sequence

In mathematics, the random Fibonacci sequence is a stochastic analogue of the Fibonacci sequence defined by the recurrence relation ${\displaystyle f_{n}=f_{n-1}\pm f_{n-2}}$, where the signs + or − are chosen at random with equal probability ${\displaystyle {\tfrac {1}{2}}}$, independently for different ${\displaystyle n}$. By a theorem of Harry Kesten and Hillel Furstenberg, random recurrent sequences of this kind grow at a certain exponential rate, but it is difficult to compute the rate explicitly. In 1999, Divakar Viswanath showed that the growth rate of the random Fibonacci sequence is equal to 1.1319882487943...(sequence A078416 in the OEIS), a mathematical constant that was later named Viswanath's constant.

Charles W. Trigg - Geometric Proof of a Result of Lehmer's

See https://www.fq.math.ca/Scanned/11-5/trigg.pdf  - Fibonacci Quarterly Vol. 11 No. 5 (Dec. 1973)

A "phi-bonacci" sequence and its consecutive quotients

A most interesting sequence:
"phi-bonacci" ?...

X(0)=0, X(1)=1
X(n)=phi (X(n-1)+X(n-2)+1) 
if n is at least 2, where phi is the Euler's totient function.

This ensures that X(n) is never greater than the 'regular' Fibonacci number F(n)
 
Plotted - the sequence of quotients X(n+1)/X(n) for n = 1,2,...,324

The raw list of the first 325 non-zero terms follows:

1, 1, 2, 2, 4, 6, 10, 16, 18, 24, 42, 66, 108, 120, 228, 348, 576, 720, 1296, 2016, 3312, 5256, 7200, 12456, 17860, 25200, 40256, 37368, 39600, 72900, 112500, 185400, 282204, 364800, 517600, 805392, 1133988, 1939380, 2788176, 4727556, 6819120, 11539840, 18324852, 28220080, 46471680, 70297856, 77663160, 98640672, 173595168, 256221952, 408844800, 613907760, 1020322800, 1598868000, 2614401972, 3650502240, 6204873360, 9219832128, 14163287040, 23375208496, 37533203556, 59869153008, 77921885248, 136242824256, 171331767600, 280988047872, 412648088320, 492483317760, 759235553856, 1248565926960, 1825274073460,

Fibonacci numbers and the extreme and mean ratio - some history

Ruth Tatlow's article The Use and Abuse of Fibonacci Numbers and the Golden Section in Musicology Today (Understanding Bach, 1, 69-85, 2006) besides being very interesting in itself as a documented criticism of the "Golden numberism [that] has thoroughly infected musicology", incidentally provides useful references for those interested in the history of the representation of the EMR ("extreme and mean ratio" or "golden section") as the limit of the sequence of quotients F_n+1/F_n of consecutive Fibonacci numbers [1]. One may wonder who noticed this first? Leonardo Pisano (c. 1170 – c. 1250, also known as Fibonacci)? Not even close!

Evidence that this fact was noticed as early as the beginning of the 16th century was discovered by Leonard Curchin and Roger Herz-Fischler (handwritten annotation in the 1509 Luca Pacioli's edition of Elements [2]). When it comes to published work which associates the EMR with the limit of the sequence of quotients of consecutive Fibonacci numbers, Johannes Kepler wrote [3] the following, in 1611, about "this proportion that the geometers of today call divine":

It is impossible to provide a perfect example in round numbers. However, the further we advance from the number one, the more perfect the example becomes. Let the smallest numbers be 1 and 1... Add them, and the sum will be 2; add to this the greater of the 1s, result 3; add 2 to this, and get 5; add 3, get 8; 5 to 8, 13; 8 to 13, 21. As 5 is to 8, so 8 is to 13 approximately, and as 8 to 13, so 13 is to 21, approximately.

However, as communicated in 1995 by Peter Schreiber [4], in a rare book by the German reckoning master Simon Jacob (d. 1564) one can find a remark that the sequence of quotients of consecutive Fibonacci numbers approaches the EMR.

NOTES

[1] The term "extreme and mean ratio" goes back to Euclid's "Elements". Luca Pacioli introduced the "divine proportion" term in 1509, while the term "golden section" was introduced in 1835 by Martin Ohm. The exact value for the EMR is (1+sqrt(5))/2. The phrase "Fibonacci sequence" was coined by Edouard Lucas (1842-1891).
[2] Leonard Curchin and Roger Herz-Fischler, "De quand date le premier rapprochement entre la suite de Fibonacci et la division en extrême et moyenne raison?" (French) ["When were the first parallels drawn between the Fibonacci sequence and the golden section?"], Centaurus 28 (1985), no. 2, 129-138.
[3] Kepler, Johannes. Vom sechseckigen Schnee. (German) [On hexagonal snowflakes]. Translated from the Latin and with an introduction and notes by Dorothea Goetz. Ostwald's Classics of the Exact Sciences, 273. Akademische Verlagsgesellschaft Geest & Portig K.-G., Leipzig, 1987.
[4] Peter Schreiber, "A Supplement to J. Shallit’s Paper "Origins of the analysis of the Euclidean algorithm"", Historia Mathematica, Vol. 22, Issue 4, 422-424 (1995). http://poncelet.math.nthu.edu.tw/disk5/js/history/1033a.pdf

Fibonacci modulo m

The general problem of the periods of the Fibonacci sequence modulo m is definitely non-trivial (with the case m = p - prime - playing a very important role). An important reference can be found here ("The Fibonacci Sequence Under Various Moduli" - M.Sc. Thesis by Marc Renault, 1996). Also see the article (PDF) "The Fibonacci sequence modulo p^2...".

An example that teachers use relatively often as a middle-school problem: "Find the period of the sequence of the last digits of the Fibonacci numbers"! That will correspond to the modulus m=10, the answer is 60, and the elements of the period are

0,1,1,2,3,5,8,3,1,4,5,9,4,3,7,0,7,7,4,1,5,6,1,7,8,5,3,8,1,9,0,
9,9,8,7,5,2,7,9,6,5,1,6,7,3,0,3,3,6,9,5,4,9,3,2 ,5,7,2,9,1

If the modulus m is 2011 (that is the 305-th prime), the period of the Fibonacci sequence modulo m is 2010.