

A242360


Irregular triangular array of numerators of the positive rational numbers ordered as in Comments.


4



1, 2, 3, 1, 4, 3, 1, 5, 5, 4, 2, 1, 6, 7, 7, 5, 5, 3, 2, 1, 7, 9, 10, 8, 9, 7, 7, 6, 4, 3, 3, 2, 1, 8, 11, 13, 11, 13, 11, 12, 11, 9, 8, 10, 9, 7, 5, 5, 4, 4, 3, 3, 2, 1, 9, 13, 16, 14, 17, 15, 17, 16, 14, 13, 17, 16, 13, 11, 12, 11, 13, 11, 13, 11, 8, 6, 7
(list;
graph;
refs;
listen;
history;
text;
internal format)



OFFSET

1,2


COMMENTS

Decree that row 1 is (1) and row 2 is (2). For n >=3, row n consists of numbers in decreasing order generated as follows: x+1 for each x in row n1 together with 1/(1+x) for each x in row n2. It is easy to prove that row n consists of F(n) numbers, where F = A000045 (the Fibonacci numbers), and that every positive rational number occurs exactly once.


LINKS

Clark Kimberling, Table of n, a(n) for n = 1..2500


EXAMPLE

First 6 rows of the array of rationals:
1/1
2/1
3/1 ... 1/2
4/1 ... 3/2 ... 1/3
5/1 ... 5/2 ... 4/3 ... 2/3 ... 1/4
6/1 ... 7/2 ... 7/3 ... 5/3 ... 5/4 ... 3/4 ... 2/5 ... 1/5
The numeratorss, by rows: 1,2,3,1,4,3,1,5,5,4,2,1,6,7,7,5,5,3,2,1.


MATHEMATICA

z = 12; g[1] = {1}; f1[x_] := x + 1; f2[x_] := 1/x; h[1] = g[1]; b[n_] := b[n] = DeleteDuplicates[Union[f1[g[n  1]], f2[g[n  1]]]];
h[n_] := h[n] = Union[h[n  1], g[n  1]]; g[n_] := g[n] = Complement [b[n], Intersection[b[n], h[n]]]; t = Table[Reverse[g[n]], {n, 1, z}]
Denominator[Flatten[t]] (* A242359 *)
Numerator[Flatten[t]] (* A242360 *)


CROSSREFS

Cf. A226080, A242359, A000045.
Sequence in context: A125933 A255054 A011857 * A299927 A006021 A002186
Adjacent sequences: A242357 A242358 A242359 * A242361 A242362 A242363


KEYWORD

nonn,easy,tabf,frac


AUTHOR

Clark Kimberling, Jun 07 2014


STATUS

approved



