a(1) = 1, a(2) = 2; for n > 1, a(n) is the least integer > a(n-1) such that the products a(i)*a(j) for 1 <= i < j <= n are all distinct.

A066724

a(1) = 1, a(2) = 2; for n > 1, a(n) is the least integer > a(n-1) such that the products a(i)*a(j) for 1 <= i < j <= n are all distinct.

Terms

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

External references