a(0) = 0, a(1) = 1; to get a(n+1) for n >= 1, let m = a(n) and consider in turn the numbers k = m-1, m-2, ..., 2, 1, m+1, m+2, m+3, ... until reach a k such that gcd(m,k) = 1 and m/k is different from all a(i)/a(i+1) for i = 0, ..., n-1.

A071912

a(0) = 0, a(1) = 1; to get a(n+1) for n >= 1, let m = a(n) and consider in turn the numbers k = m-1, m-2, ..., 2, 1, m+1, m+2, m+3, ... until reach a k such that gcd(m,k) = 1 and m/k is different from all a(i)/a(i+1) for i = 0, ..., n-1.

Terms

    a(0) =0a(1) =1a(2) =1a(3) =2a(4) =1a(5) =3a(6) =2a(7) =3a(8) =1a(9) =4a(10) =3a(11) =4a(12) =1a(13) =5a(14) =4a(15) =5a(16) =3a(17) =5a(18) =2a(19) =5a(20) =1a(21) =6a(22) =5a(23) =6a(24) =1a(25) =7a(26) =6a(27) =7a(28) =5a(29) =7

External references