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

 

Logo


Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A322575 z(1) = 0, and for any n > 0, z(4*n-2) = z(n) + k(n), z(4*n-1) = z(n) + i*k(n), z(4*n) = z(n) - k(n) and z(4*n+1) = z(n) - i*k(n) where k(n) is the least positive integer not leading to a duplicate term in sequence z (and i denotes the imaginary unit); a(n) is the imaginary part of z(n). 3
0, 0, 1, 0, -1, 0, 3, 0, -3, 1, 4, 1, -2, 0, 3, 0, -3, -1, 2, -1, -4, 0, 1, 0, -1, 3, 4, 3, 2, 0, 8, 0, -8, -3, -2, -3, -4, 1, 5, 1, -3, 4, 13, 4, -5, 1, 2, 1, 0, -2, 5, -2, -9, 0, 7, 0, -7, 3, 7, 3, -1, 0, 11, 0, -11, -3, 2, -3, -8, -1, 4, -1, -6, 2, 10, 2 (list; graph; refs; listen; history; text; internal format)
OFFSET

1,7

LINKS

Rémy Sigrist, Table of n, a(n) for n = 1..10000

Rémy Sigrist, PARI program for A322575

PROG

(PARI) See Links section.

CROSSREFS

See A322574 for the real part of z and additional comments.

Sequence in context: A318504 A318505 A237595 * A166445 A298082 A085919

Adjacent sequences:  A322572 A322573 A322574 * A322576 A322577 A322578

KEYWORD

sign,look

AUTHOR

Rémy Sigrist, Dec 17 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 | Recent
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy. .

Last modified July 5 17:57 EDT 2020. Contains 335473 sequences. (Running on oeis4.)