Year-end appeal: Please make a donation to the OEIS Foundation to support ongoing development and maintenance of the OEIS. We are now in our 61st year, we have over 378,000 sequences, and we’ve reached 11,000 citations (which often say “discovered thanks to the OEIS”).
%I #5 Apr 20 2013 02:48:50
%S 1,3,2,4,7,5,6,10,18,13,8,15,26,47,34,9,20,39,68,123,89,11,23,52,102,
%T 178,322,233
%N Array T(n,k) by antidiagonals; T(n,k) = position in row n of k-th occurrence of the Fibonacci number F(2n) in A134567.
%C (Row 1) = A000201, the lower Wythoff sequence (Row 2) = (Column 2 of Wythoff array) = A035336 (Row 3) = (Column 4 of Wythoff array) = A035338 (Row 4) = (Column 6 of Wythoff array) = A035340 (Column 1) = A001519 (bisection of Fibonacci sequence) (Column 2) = A005248 (bisection of Lucas sequence) (Column 3) = A052995 Row 1 is the ordered union of all odd-numbered columns of the Wythoff array; and A134571 is a permutation of the positive integers.
%e Northwest corner:
%e 1 3 4 6 8 9 11 12 14 16
%e 2 7 10 15 20 23
%e 5 18 26 39 52 60
%e 13 47 68 102 136 157
%e Row 1 consists of numbers k such that 1 is the least m for which {-m*tau}<{k*tau}, where tau=(1+sqrt(5))/2 and {} denotes fractional part.
%Y Cf. A134567, A134570.
%K nonn,tabl
%O 1,2
%A _Clark Kimberling_, Nov 02 2007