A383586 a(n) is the minimum sum of a nonnegative integer 4-tuple 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.
0, 4, 10, 20, 40, 76, 177, 387, 829, 1749
Offset: 0
Examples
The 4-tuple (1,2,3,4), with sum 1+2+3+4=10, takes two moves to reach a 0 component. (1,2,3,4) -> (2,2,2,4) -> (0,4,2,4) and is a minimum sum for n=2.
Links
- Gerold Jäger and Tuomo Lehtilä, The Generalized Double Pouring Problem: Analysis, Bounds and Algorithms, arXiv:2504.03039 [math.CO], 2025. See Definition 4(a) p. 3, and Table 1, p. 12.