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 A256001 #47 May 08 2025 08:54:02 %S A256001 0,3,6,11,15,23,27,45,81,105,195,329,597,885,1425,2793,4725,8025, %T A256001 14265,23205,41685 %N 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. %C A256001 a(21) > 65532. - _Karl Desfontaines_, Mar 02 2022 %H A256001 IBM's Ponder This, <a href="https://research.ibm.com/haifa/ponderthis/challenges/May2015.html">3 people betting game</a>, May 2015, challenge essentially asks for (a witness for) a(12). %H A256001 Fabian Frei, Peter Rossmanith, and David Wehner, <a href="https://drops.dagstuhl.de/opus/volltexte/2020/12760/pdf/lipics-vol157-fun2021-complete.pdf#page=259">An Open Pouring Problem</a>, 10th International Conference on Fun with Algorithms (FUN 2021). Schloss Dagstuhl-Leibniz-Zentrum für Informatik, 14:1-9. %H A256001 John Tromp, <a href="/A256001/a256001.c.txt">C program</a> computing diameter and witness for each sum. %e A256001 The triple (1,2,3) is the triple with minimum sum that has no 0's or equal members and reaches a 0 after the 2 moves (1,2,3) -> (2,2,2) -> (4,0,2). Since the sum of this triple is 6, a(2) = 6. %o A256001 (C) // See link above for a C program from whose output the terms above were derived. %Y A256001 Cf. A383586 (for 4-tuples), A383587 (for 5-tuples), A383588 (for 6-tuples). %K A256001 nonn,more %O A256001 0,2 %A A256001 _John Tromp_, May 06 2015 %E A256001 a(19)-a(20) from _Karl Desfontaines_, Mar 02 2022