login
This site is supported by donations to The OEIS Foundation.

 

Logo


Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A275303 Iterations at which Langton's Ant living on triangular tiling reaches the distance of n from the origin for the first time. 4
1, 2, 3, 14, 15, 48, 53, 136, 145, 362, 375, 474, 491, 724, 745, 1904, 1921, 2234, 2267, 2362, 2383, 2500, 2537, 2786, 2811, 3542, 3575, 8304, 8325, 8432, 8501, 8948, 8989, 14858, 14911, 15256, 15309, 18258, 18367, 21804, 22021, 22380, 22453, 23222, 23279 (list; graph; refs; listen; history; text; internal format)
OFFSET

1,2

COMMENTS

The distance is defined as the number of steps needed to reach the origin (analog of Manhattan distance).

a(n) ~ c*n^2; however, the first several hundreds of terms are very well described by the approximate formula c'*n^(2.8). [amended by Andrey Zabolotskiy, Oct 09 2016 and Nov 02 2016]

LINKS

Andrey Zabolotskiy, Table of n, a(n) for n = 1..1500 (calculated using Oleg Nikulin's program)

Wikipedia, Turmite

CROSSREFS

Cf. A269757, A275302, A275304 (first differences), A275305.

Sequence in context: A032806 A225756 A260143 * A281500 A041009 A042367

Adjacent sequences:  A275300 A275301 A275302 * A275304 A275305 A275306

KEYWORD

nonn

AUTHOR

Oleg Nikulin, Jul 22 2016

STATUS

approved

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recent | More pages
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy. .

Last modified November 16 02:33 EST 2018. Contains 317252 sequences. (Running on oeis4.)