|
|
A226596
|
|
Lengths of maximal non-crossing and non-overlapping increasing paths in n X n grids.
|
|
3
|
|
|
|
OFFSET
|
1,2
|
|
COMMENTS
|
The path is allowed to touch but not cross itself on single points, but not on segments of any length. "Increasing" means that the (Euclidean) length of each line segment must be strictly longer than the last.
|
|
LINKS
|
|
|
FORMULA
|
|
|
EXAMPLE
|
A solution for the case a(8)=20 is
-------------------------
01 02 . . . . . 16
.. . 03 . . . . 14
09 . 15 . 05 . . 12
.. . 04 . . . . .
.. . 06 13 . 07 . 21
.. . 08 . 11 . . 19
10 . . . . . . 17
20 18 . . . . . .
-------------------------
|
|
CROSSREFS
|
|
|
KEYWORD
|
nonn,hard,more
|
|
AUTHOR
|
|
|
STATUS
|
approved
|
|
|
|