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

 

Logo
Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A300444 The minimal number of steps that a path-avoiding snail must take in order to have a step of length (2n-1)/2^k for some k. 0
1, 7, 9, 8, 10, 11, 10, 9, 11, 12, 11, 12, 11, 12, 11, 10, 12, 13, 14, 13, 13, 14, 12, 13, 12, 13, 14, 13, 12, 13, 12, 11, 13, 14, 15, 14, 15, 14, 15, 14, 14, 15, 15, 14, 14, 14, 13, 14, 13, 14, 15, 14, 13, 15, 15, 14, 13, 14, 15, 14, 13, 14, 13, 12, 14, 15 (list; graph; refs; listen; history; text; internal format)
OFFSET
1,2
COMMENTS
The path-avoiding snail takes steps of unit length if doing so does not cause it to collide with its trail. If a unit length step would cause a collision, it travels halfway to its trail. After every step the snail may turn left or right or remain straight.
LINKS
CROSSREFS
Sequence in context: A197516 A019862 A330865 * A363377 A371135 A021930
KEYWORD
nonn,walk
AUTHOR
Peter Kagey, Mar 05 2018
STATUS
approved

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 March 28 16:28 EDT 2024. Contains 371254 sequences. (Running on oeis4.)