This is a front-end for the Online Encyclopedia of Integer Sequences, made by Christian Perfect. The idea is to provide OEIS entries in non-ancient HTML, and then to think about how they're presented visually. The source code is on GitHub.
%I A383586 #16 May 08 2025 05:01:36 %S A383586 0,4,10,20,40,76,177,387,829,1749 %N 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. %H A383586 Gerold Jäger and Tuomo Lehtilä, <a href="https://arxiv.org/abs/2504.03039">The Generalized Double Pouring Problem: Analysis, Bounds and Algorithms</a>, arXiv:2504.03039 [math.CO], 2025. See Definition 4(a) p. 3, and Table 1, p. 12. %e A383586 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. %Y A383586 Cf. A256001 (for 3-tuples), A383587 (for 5-tuples), A383588 (for 6-tuples) %K A383586 nonn,more %O A383586 0,2 %A A383586 _Gerold Jager_, May 01 2025