OFFSET
1,2
COMMENTS
LINKS
B. Avila and T. Khovanova, Free Fibonacci Sequences, arXiv preprint arXiv:1403.4614, 2014 and J. Int. Seq. 17 (2014) # 14.8.5
EXAMPLE
For n=4 there are four possible cycles: A trivial cycle of length 1: 0; two cycles of length 6: 0,1,1,2,3,1; and a cycle of length 3: 0,2,2. Hence, a(4) = round((1+9+36+36)/16) = 5.
MATHEMATICA
cl[i_, j_, n_] := (step = 1; first = i; second = j;
next = Mod[first + second, n];
While[second != i || next != j, step++; first = second;
second = next; next = Mod[first + second, n]]; step)
Table[Round[
Total[Flatten[Table[cl[i, j, n], {i, 0, n - 1}, {j, 0, n - 1}]]]/
n^2], {n, 70}]
CROSSREFS
KEYWORD
nonn
AUTHOR
Brandon Avila and Tanya Khovanova, Dec 06 2013
STATUS
approved