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 A383588 #14 May 12 2025 19:27:33 %S A383588 0,6,21,45,123,335 %N A383588 a(n) is the minimum sum of a nonnegative integer 6-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 A383588 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 A383588 The 6-tuple (1,2,3,4,5,6), with sum 1+2+3+4+5+6=21, takes two moves to reach a 0 component. (1,2,3,4,5,6) -> (2,2,2,4,5,6) -> (0,4,2,4,5,6) and is a minimum sum for n=2. %e A383588 From _Bert Dobbelaere_, May 11 2025: (Start) %e A383588 a(3) = 45 due to (1,4,6,9,11,14) %e A383588 a(4) = 123 due to (1,9,13,20,37,43) %e A383588 a(5) = 335 due to (7,23,40,45,81,139) %e A383588 (End) %Y A383588 Cf. A256001 (for 3-tuples), A383586 (for 4-tuples), A383587 (for 5-tuples). %K A383588 nonn,more %O A383588 0,2 %A A383588 _Gerold Jager_, May 01 2025 %E A383588 a(5) from _Bert Dobbelaere_, May 11 2025