robert.ferreol at gmail.com
Fri Nov 30 16:20:00 CET 2018
In https://oeis.org/A226080 is written :
For n > 2, g(n) consists of F(n-2) numbers < 1 and F(n-1) numbers > 1,
hence the name "rabbit ordering" since the n-th generation has F(n-2)
non-reproducing pairs and F(n-1) reproducing pairs, as in the classical
rabbit-reproduction introduction to Fibonacci numbers.
I think it's :
the n-th generation has F(n-2) reproducing pairs and F(n-1) NON
-reproducing pairs, as in the classical rabbit-reproduction introduction
to Fibonacci numbers.
(Since Fibonacci rabbits breed two months after birth)
Do you agree ?
6, Rue des Annelets 75019 PARIS
01 42 41 91 98
maths, ex mpsi Fénelon Paris
More information about the SeqFan