The OEIS mourns the passing of Jim Simons and is grateful to the Simons Foundation for its support of research in many branches of science, including the OEIS.
The OEIS is supported by the many generous donors to the OEIS Foundation.

 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 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. 1
 0, 3, 6, 11, 15, 23, 27, 45, 81, 105, 195, 329, 597, 885, 1425, 2793, 4725, 8025, 14265, 23205, 41685 (list; graph; refs; listen; history; text; internal format)
 OFFSET 0,2 COMMENTS a(21) > 65532. - Karl Desfontaines, Mar 02 2022 LINKS Table of n, a(n) for n=0..20. IBM's Ponder This, 3 people betting game, May 2015, challenge essentially asks for (a witness for) a(12). Fabian Frei, Peter Rossmanith, and David Wehner, An Open Pouring Problem, 10th International Conference on Fun with Algorithms (FUN 2021). Schloss Dagstuhl-Leibniz-Zentrum für Informatik, 14:1-9. John Tromp, C program computing diameter and witness for each sum. EXAMPLE 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. PROG See link above for a C program from whose output the terms above were derived. CROSSREFS Sequence in context: A324773 A152682 A059753 * A131665 A363610 A132158 Adjacent sequences: A255998 A255999 A256000 * A256002 A256003 A256004 KEYWORD nonn,more AUTHOR John Tromp, May 06 2015 EXTENSIONS a(19)-a(20) from Karl Desfontaines, Mar 02 2022 STATUS approved

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recents
The OEIS Community | Maintained by The OEIS Foundation Inc.

Last modified May 24 03:56 EDT 2024. Contains 372771 sequences. (Running on oeis4.)