The OEIS Foundation is supported by donations from users of the OEIS and by a grant from the Simons Foundation.

 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 A134570 Array T(n,k) by antidiagonals; T(n,k) = position in row n of k-th occurrence of the Fibonacci number F(2n+1) in A134566. 4

%I

%S 2,5,1,7,4,3,10,6,11,8,13,9,16,29,21,15,12,24,42,76,55,18,14,32,63,

%T 110,199,144,20,17,37,84,165,288,521,377,23,19,45,97,220,432,754

%N Array T(n,k) by antidiagonals; T(n,k) = position in row n of k-th occurrence of the Fibonacci number F(2n+1) in A134566.

%C (Row 1) = A001950, the upper Wythoff sequence (Row 2) = (Column 1 of Wythoff array) = A003622 (Row 3) = (Column 3 of Wythoff array) = A035337 (Row 4) = (Column 5 of Wythoff array) = A035339 Except for initial terms, the first two columns of A134570 are bisected Fibonacci and Lucas sequences, A001906 and A002878, resp. Row 1 is the ordered union of all even-numbered columns of the Wythoff array; and A134570 is a permutation of the positive integers.

%e Northwest corner:

%e 2 5 7 10 13 15 18 20 23 26

%e 1 4 6 9 12 14

%e 3 11 16 24 32 37

%e 8 29 42 63 84 97

%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. A134566, A134571.

%K nonn,tabl

%O 1,1

%A _Clark Kimberling_, Nov 02 2007

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recent
The OEIS Community | Maintained by The OEIS Foundation Inc.

Last modified June 13 00:57 EDT 2021. Contains 344980 sequences. (Running on oeis4.)