The greedy rational packing sequence: a(1) = 1; for n > 1, a(n) is smallest number such that the ratios a(i)/a(j) for 1 <= i < j <= n are all distinct.

A066720

The greedy rational packing sequence: a(1) = 1; for n > 1, a(n) is smallest number such that the ratios a(i)/a(j) for 1 <= i < j <= n are all distinct.

Terms

    a(0) =1a(1) =2a(2) =3a(3) =5a(4) =7a(5) =8a(6) =11a(7) =13a(8) =17a(9) =18a(10) =19a(11) =23a(12) =29a(13) =31a(14) =37a(15) =41a(16) =43a(17) =47a(18) =50a(19) =53a(20) =59a(21) =60a(22) =61a(23) =67a(24) =71a(25) =73a(26) =79a(27) =81a(28) =83a(29) =89

External references