OFFSET
1,4
COMMENTS
Generalize the Fibonacci sequence recurrence equation as: F_(n+1) = A*F_n + B*F_(n-1), where A and B are positive integers. As n goes to infinity, the ratio F_n / F_(n-1) approaches the positive real number r = (A + sqrt(A*A + 4B))/2. This sequence gives the A values in increasing order of r.
In case of a tie in r values, then sort in increasing order of sqrt(A*A + B*B).
This A sequence appears to be the ordinal transform of the B sequence (A249974) and vice versa. The associative arrays of A and B are transposes. The first row of A's associative array seems to be A006000.
For the A and B values leading to a positive integer limit r see a comment in A063929. - Wolfdieter Lang, Jan 12 2015
EXAMPLE
a(6) = 2 because the 6th smallest value of r (approximately 2.732050808) is that for A=2, B=2.
PROG
(PARI) \\ see A249974
CROSSREFS
KEYWORD
easy,nonn
AUTHOR
Kerry Mitchell, Nov 09 2014
EXTENSIONS
Edited. - Wolfdieter Lang, Jan 11 2015
STATUS
approved