Fibonacci-Cayley numbers and repetition patterns in genomic DNA (Q1430520)

The basic idea of the paper is inspired from one of modern and actual areas of biology -- research on repetitive genomic DNA. Let \(k= f_{c_x}\) be called the Fibonacci-Cayley index of a positive integer \(x\) that is the largest natural number \(k\) for which there are natural numbers \(a\), \(b\) so \(x= aF(k-1)+ bF(k)\), where \(F(1)= 1,\dots, F(k+1)= F(k-1)+ F(k)\), and \[ f_{c_k}- {5\over 2}\leq {k_r+ k-1\over 2}\leq f_{c_x}+ 1, \] where \(k_1\) and \(k_r\) are the smallest and the largest Fibonacci numbers occurring in the Zeckendorf decomposition of \(x\) in the form \[ x= \sum^r_{i=1} F(k_i)\qquad (0< k_1- 1< k_2- 2<\cdots< k_r- r). \]