login
The OEIS Foundation is supported by donations from users of the OEIS and by a grant from the Simons Foundation.

 

Logo

Thanks to everyone who made a donation during our annual appeal!
To see the list of donors, or make a donation, see the OEIS Foundation home page.

Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A326171 Let z be a sequence of distinct Gaussian integers such that z(1) = 0, z(2) = 2+i (where i denotes the imaginary unit), for n > 1, z(n+1) the Gaussian integer with least norm at one knight move from z(n) (in case of a tie, choose the value such that Im(z(n+1)/z(n))>0); a(n) is the imaginary part of z(n). 2
0, 1, -1, 1, -1, 0, 1, -1, 1, 0, -2, -1, 1, 2, 0, -2, -1, -3, -4, -2, 0, 2, 1, -1, -3, -2, 0, 1, 2, 3, 4, 3, 2, 0, 2, 3, 2, 0, -2, -3, -2, -1, -3, -4, -5, -3, -1, 1, 3, 4, 3, 2, 0, -2, -3, -4, -3, -1, 1, 2, 3, 4, 3, 1, -1, -3, -4, -5, -4, -3, -1, 1, 2, 0, -2 (list; graph; refs; listen; history; text; internal format)
OFFSET

1,11

COMMENTS

See A326170 for the real part and additional comments.

LINKS

Table of n, a(n) for n=1..75.

Rémy Sigrist, PARI program for A326171

PROG

(PARI) See Links section.

CROSSREFS

Cf. A326170.

Sequence in context: A055138 A177717 A155997 * A123223 A088226 A244658

Adjacent sequences:  A326168 A326169 A326170 * A326172 A326173 A326174

KEYWORD

sign,fini

AUTHOR

Rémy Sigrist, Jun 10 2019

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
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy. .

Last modified January 22 07:39 EST 2020. Contains 331139 sequences. (Running on oeis4.)