|
%I #7 Dec 30 2020 03:00:49
%S 1,2,4,3,6,9,5,7,12,17,8,10,14,22,25,13,11,15,27,30,38,21,16,19,28,40,
%T 43,59,34,18,20,33,41,46,67,64,55,26,23,35,48,51,77,72,98,89,29,24,36,
%U 49,61,85,80,101,106,144,42,31,44,56,62,95,93,132,114,153,233,47,32,45
%N Rectangular array T by antidiagonals: row n consists of ranks of n in A000119.
%C Every positive integer occurs exactly once in T; thus a is a permutation of the positive integers. Row 1 consists of Fibonacci numbers. To obtain T from the array T' in A094607, add 1 to every number in T', then shift row 1 one place to the right and fill the initial place with 1.
%H <a href="/index/Per#IntegerPermutation">Index entries for sequences that are permutations of the natural numbers</a>
%e A northwest corner of T:
%e 1 2 3 5 8
%e 4 6 7 10 11
%e 9 12 14 15 19
%e 17 22 27 28 33
%Y Cf. A000045, A000119, A094607.
%K nonn,tabl
%O 1,2
%A _Clark Kimberling_, May 14 2004
|
