a(0) = 1; for n>0, if gcd(a(n-1),n) = 1 then a(n) = n*a(n-1) else a(n) = least integer multiple of a(n-1)/n.

A094299

a(0) = 1; for n>0, if gcd(a(n-1),n) = 1 then a(n) = n*a(n-1) else a(n) = least integer multiple of a(n-1)/n.

Terms

    a(0) =1a(1) =1a(2) =2a(3) =6a(4) =3a(5) =15a(6) =5a(7) =35a(8) =280a(9) =2520a(10) =252a(11) =2772a(12) =231a(13) =3003a(14) =429a(15) =143a(16) =2288a(17) =38896a(18) =19448a(19) =369512a(20) =92378a(21) =1939938a(22) =88179a(23) =2028117a(24) =676039a(25) =16900975a(26) =1300075a(27) =35102025a(28) =5014575a(29) =145422675

External references