Triangular array T read by rows: T(n,k) = sum of numbers c in the form c = bq + r when Euclidean algorithm acts on n, k, for 1 <= k <= n, n >= 1.

A049840

Triangular array T read by rows: T(n,k) = sum of numbers c in the form c = bq + r when Euclidean algorithm acts on n, k, for 1 <= k <= n, n >= 1.

Terms

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

External references