a(1) = 1; for all n >= 2, we choose a(n) to be as small as possible so that for all i = 1, ..., n, the sequence of the i-th divisors of a(1), a(2), ..., a(n) is nonincreasing.

A136339

a(1) = 1; for all n >= 2, we choose a(n) to be as small as possible so that for all i = 1, ..., n, the sequence of the i-th divisors of a(1), a(2), ..., a(n) is nonincreasing.

Terms

    a(0) =1a(1) =2a(2) =4a(3) =6a(4) =12a(5) =24a(6) =48a(7) =60a(8) =120a(9) =240a(10) =360a(11) =720a(12) =1260a(13) =1680a(14) =2520a(15) =5040a(16) =10080a(17) =15120a(18) =25200a(19) =27720a(20) =55440a(21) =110880a(22) =166320a(23) =277200a(24) =554400a(25) =720720a(26) =1441440a(27) =2162160a(28) =3603600a(29) =7207200

External references