Maximum length of Euclidean algorithm starting with n and any nonnegative i<n.

Terms

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