Triangular array T given by rows: T(n,k)=sum of quotients when Euclidean algorithm acts on n and k; for k=1,2,...,n; n=1,2,3,...; also number of subtraction steps when computing gcd(n,k) using subtractions rather than divisions.
A049834
Triangular array T given by rows: T(n,k)=sum of quotients when Euclidean algorithm acts on n and k; for k=1,2,...,n; n=1,2,3,...; also number of subtraction steps when computing gcd(n,k) using subtractions rather than divisions.
Terms
- a(0) =1a(1) =2a(2) =1a(3) =3a(4) =3a(5) =1a(6) =4a(7) =2a(8) =4a(9) =1a(10) =5a(11) =4a(12) =4a(13) =5a(14) =1a(15) =6a(16) =3a(17) =2a(18) =3a(19) =6a(20) =1a(21) =7a(22) =5a(23) =5a(24) =5a(25) =5a(26) =7a(27) =1a(28) =8a(29) =4
External references
- oeis: A049834