|
Search: id:A101857
|
|
|
| A101857 |
|
Number of possibly-self-intersecting walks that it is possible for an accelerating ant to produce with n steps (rotations & reflections not included). On step 1 the ant moves forward 1 unit, then turns left or right and proceeds 2 units, then turns left or right until at the end of its n-th step it arrives back at its starting place. |
|
+0
2
|
|
| 0, 0, 0, 0, 0, 0, 1, 1, 0, 0, 0, 0, 0, 0, 16, 28, 0, 0, 0, 0, 0, 0, 1190, 2108, 0, 0, 0, 0, 0, 0
(list; graph; listen)
|
|
|
OFFSET
|
1,15
|
|
|
COMMENT
|
Accelerating ant walks can only arrive back at the starting place if the number of moves is -1 or 0 mod(8).
|
|
EXAMPLE
|
For example: a(7) = 1 because of the following solution:
655555XXX
6XXXX4XXX
6XXXX4XXX
6XXXX4XXX
6XXXX4333
6XXXXXXX2
777777712
where the ant starts at the "1" and moves right 1 space, up 2 spaces and so on...
|
|
CROSSREFS
|
Cf. A101856.
Sequence in context: A067650 A123963 A073396 this_sequence A166595 A064803 A164052
Adjacent sequences: A101854 A101855 A101856 this_sequence A101858 A101859 A101860
|
|
KEYWORD
|
nice,nonn
|
|
AUTHOR
|
Gordon Robert Hamilton (hamiltonian(AT)shaw.ca), Jan 27 2005
|
|
|
Search completed in 0.002 seconds
|
