login
A224876
On an hexagonal lattice, repeatedly: mark the current point and then move forward to the nearest unmarked point and then rotate 120 degrees clockwise. a(n) gives the number of steps between the n-th and (n+1)-th marks.
2
1, 1, 2, 1, 2, 1, 3, 1, 3, 1, 4, 1, 4, 1, 5, 1, 5, 1, 6, 1, 3, 1, 3, 4, 3, 4, 3, 5, 1, 3, 1, 6, 3, 6, 3, 7, 1, 6, 1, 8, 1, 6, 1, 7, 3, 8, 3, 8, 1, 8, 1, 9, 1, 9, 1, 10, 1, 2, 1, 3, 10, 3, 10, 3, 1, 2, 1, 12, 1, 3, 1, 5, 1, 2, 1, 12, 1, 3, 1, 5, 9, 4, 11, 1, 2, 1
OFFSET
1,3
COMMENTS
Apparently, every lattice point will be marked.
EXAMPLE
This diagram depicts the first 9 marks:
\ / \ / \ /
--4---5---.--
/ \ / \ / \
-7---1---2---8-
\ / \ / \ / \
--6---3---9--
/ \ / \ / \
a(1) = number of steps between 1st and 2nd marks = 1;
a(2) = number of steps between 2nd and 3rd marks = 1;
a(3) = number of steps between 3rd and 4th marks = 2;
a(4) = number of steps between 4th and 5th marks = 1;
a(5) = number of steps between 5th and 6th marks = 2;
a(6) = number of steps between 6th and 7th marks = 1;
a(7) = number of steps between 7th and 8th marks = 3;
a(8) = number of steps between 8th and 9th marks = 1.
PROG
(Perl) See Links section.
CROSSREFS
Sequence in context: A282903 A332677 A090329 * A340830 A027353 A027352
KEYWORD
nonn,walk
AUTHOR
Paul Tek, Jul 23 2013
STATUS
approved