Minimum sum of a nonnegative integer triple that takes n moves to reach a 0 component, where a move picks two components, subtracts the smaller from the larger, and doubles the smaller.

A256001

Minimum sum of a nonnegative integer triple that takes n moves to reach a 0 component, where a move picks two components, subtracts the smaller from the larger, and doubles the smaller.

Terms

    a(0) =0a(1) =3a(2) =6a(3) =11a(4) =15a(5) =23a(6) =27a(7) =45a(8) =81a(9) =105a(10) =195a(11) =329a(12) =597a(13) =885a(14) =1425a(15) =2793a(16) =4725a(17) =8025a(18) =14265a(19) =23205a(20) =41685a(21) =83265a(22) =141141a(23) =256215a(24) =456435

External references