|
%I #20 Apr 17 2020 11:27:07
%S 1,2,3,4,6,5,7,10,8,9,11,15,12,14,13,16,21,17,20,18,19,22,28,23,27,24,
%T 26,25,29,36,30,35,31,34,32,33,37,45,38,44,39,43,40,42,41,46,55,47,54,
%U 48,53,49,52,50,51,56,66,57,65,58,64,59,63,60,62,61,67,78,68,77,69,76
%N Triangle T read by rows: row n consists of the numbers C(n,2)+1 to C(n+1,2); numbers in odd-numbered places form an increasing sequence and the others a decreasing sequence.
%C Arrange the quotients F(i)/F(j) of Fibonacci numbers, for 2<=i<j<=n, in increasing order. Then the positions of the F(i)/F(n-k) are the first n-k-2 terms of the diagonal T(i,i-k), for k=0,1,2,...,n-3.
%H Michael De Vlieger, <a href="/A057027/b057027.txt">Table of n, a(n) for n = 1..10000</a>
%H <a href="/index/Per#IntegerPermutation">Index entries for sequences that are permutations of the natural numbers</a>
%e For n=6, the ordered quotients are 1/8, 1/5, 2/8, 1/3, 3/8, 2/5, 1/2, 3/5, 5/8, 2/3; the positions of 1/5, 2/5, 3/5 are 2, 6, 8 (first terms of diagonal T(i, i-1)).
%e Triangle starts:
%e 1;
%e 2, 3;
%e 4, 6, 5;
%e 7,10, 8, 9;
%e ...
%t nn= 12; t = Table[Range[Binomial[n, 2] + 1, Binomial[n + 1, 2]], {n, nn}]; Table[t[[n, If[OddQ@ k, Ceiling[k/2], -k/2] ]], {n, nn}, {k, n}] // Flatten (* _Michael De Vlieger_, Jul 02 2016 *)
%Y Reflection of the array in A057028 about its central column, a permutation of the natural numbers.
%Y Inverse permutation to A064578. Central column: A057029.
%K nonn,tabl
%O 1,2
%A _Clark Kimberling_, Jul 28 2000
%E Corrected and extended by _Vladeta Jovovic_, Oct 18 2001
|
