|
|
A226595
|
|
Lengths of maximal nontouching increasing paths in n X n grids.
|
|
5
|
|
|
0, 2, 4, 7, 9, 12, 15, 17, 20, 24, 27, 29, 33, 36, 39
(list;
graph;
refs;
listen;
history;
text;
internal format)
|
|
|
OFFSET
|
1,2
|
|
COMMENTS
|
The path is not allowed to touch itself, not even on single points. "Increasing" means that the (Euclidean) length of each line segment must be strictly longer than the last.
|
|
LINKS
|
|
|
FORMULA
|
|
|
EXAMPLE
|
An example for a(8)=17
-------------------------
01 02 . . . . 05 .
.. . 03 . 04 . . 18
09 07 . . 06 . . 16
.. . . . . . . 14
.. . . . . . . 12
.. . 08 . . . . .
10 17 15 13 . . . .
.. . . . 11 . . .
-------------------------
|
|
CROSSREFS
|
|
|
KEYWORD
|
nonn,hard,nice,more
|
|
AUTHOR
|
|
|
EXTENSIONS
|
|
|
STATUS
|
approved
|
|
|
|