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


(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A350627 Solution to Forest of Numbers (Bosque de NĂºmeros) puzzle if we start with the numbers 1 through n (see Comments). 7
1, 10, 22, 30, 36, 44 (list; graph; refs; listen; history; text; internal format)



Start with an infinite square grid. Each cell has eight neighbors. Place the numbers 1, 2, ..., n anywhere. Now place the numbers n+1, n+2, ..., m in order, subject to the rule that when you place k, the sum of its neighbors must equal k. Then a(n) is the maximum m that can be achieved.

This is similar to the Stepping Stones problem discussed in A337663, but predates it by more than 20 years.

As can be seen in the El Acertijo (The Riddle) links and in Rodolfo Kurchan's webpage, there are at least six similar problems, for example when the numbers are restricted to an n X n square board. All of these are worthy of inclusion in the OEIS once enough terms are known.


Table of n, a(n) for n=1..6.

El Acertijo, Number 5, Page 8, April 1993.

El Acertijo, Number 5, Page 9, April 1993.

El Acertijo, Number 5, Page 18, April 1993.

El Acertijo, Number 7, Page 15, August/September 1993.

Rudolfo Kurchan, Puzzle Fun

Giorgio Vecchi, Solution for a(5) = 36

Giorgio Vecchi, Solution for a(6) = 44


Cf. A337663 (Stepping Stones problem).

Sequence in context: A303747 A007366 A302280 * A109958 A053361 A214153

Adjacent sequences:  A350624 A350625 A350626 * A350628 A350629 A350630




N. J. A. Sloane, Feb 05 2022


a(5)-a(6) from Rodolfo Kurchan, Mar 29 2022



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.

License Agreements, Terms of Use, Privacy Policy. .

Last modified August 7 13:04 EDT 2022. Contains 355989 sequences. (Running on oeis4.)