The OEIS is supported by the many generous donors to the OEIS Foundation.

 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 A355903 Variant of Stepping Stones problem: here the stone you place only needs to divide the sum of its 8 neighbors. 2
 1, 27, 41, 67 (list; graph; refs; listen; history; text; internal format)
 OFFSET 1,2 COMMENTS To find a(n), start by placing n stones labeled 1 on an infinite chessboard. Set k=2. At step k, you must place a stone labeled k in a square where the sum of its neighbors is x*k for some x >= 1. That is, the sum of the neighbors must be an integral multiple of k. If there is no way to do that, this game ends, and you win k-1 dollars. If you can do it, you increment k and repeat. Then a(n) = maximum number of dollars you can win with optimal play for any initial placement of the n starting stones. The sequence was proposed by Skylark Xentha Murphy-Davies on Sep 16 2022. She found lower bounds for a(2), a(3), and a(4). On Sep 17 2022, Hugo van der Sanden showed that her lower bound for a(2) was the correct value, and found the values of a(3) and a(4). In the original version of the problem (see A337663) each stone that you place must equal the sum of its 8 neighbors. LINKS Table of n, a(n) for n=1..4. Skylark Xentha Murphy-Davies and Hugo van der Sanden, Illustration for a(2) = 27 (Discovered by Skylark Xentha Murphy-Davies and proved optimal by Hugo van der Sanden.) [There are two choices for the 27 stone, indicated by dashed lines. The 27 in the top left corner is not part of the arrangement.] N. J. A. Sloane, Brady Haran and Pete McPartlan, Stones on an Infinite Chessboard, Numberphile video (2022). Hugo van der Sanden, Maximal examples for a(2), a(3), a(4) EXAMPLE Illustration for a(2) = 27 (discovered by Skylark Xentha Murphy-Davies and proved optimal by Hugo van der Sanden): . . . . . . . . . 21 20 . . . . . 23 13 9 18 . . . . . 12 5 4 . 14 25 . . 27 10 1 3 11 26 . . . . . 2 6 . 22 . . . 19 . 1 7 15 . . . . 17 16 8 . . . . . . . 24 . . . . . . . . . CROSSREFS Cf. A337663. Sequence in context: A181489 A117103 A217008 * A124940 A272829 A306118 Adjacent sequences: A355900 A355901 A355902 * A355904 A355905 A355906 KEYWORD nonn,bref,more AUTHOR N. J. A. Sloane, Sep 17 2022, based on emails from Skylark Xentha Murphy-Davies and Hugo van der Sanden 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 June 6 05:06 EDT 2023. Contains 363139 sequences. (Running on oeis4.)