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!)
A319562 Let f(1) = 1, f(2) = 1 + i (where i denotes the imaginary unit), and for n > 1, f(n+1) is the Gaussian integer in the first quadrant (with positive real part and nonnegative imaginary part) with least modulus and sharing a prime factor with f(n) (in case of a tie, minimize the imaginary part); a(n) = the real part of f(n). 2
1, 1, 2, 2, 3, 1, 2, 1, 2, 4, 4, 3, 3, 6, 5, 2, 4, 1, 3, 6, 4, 5, 1, 2, 3, 4, 8, 6, 5, 4, 3, 6, 3, 2, 7, 5, 1, 7, 2, 4, 3, 5, 10, 8, 6, 7, 1, 2, 5, 6, 12, 8, 4, 8, 7, 1, 9, 7, 2, 4, 9, 4, 8, 1, 5, 10, 9, 9, 3, 7, 7, 14, 10, 6, 8, 6, 10, 2, 9, 2, 4, 5, 7, 14 (list; graph; refs; listen; history; text; internal format)
OFFSET

1,3

COMMENTS

See A319561 for the square of the modulus of f and additional comments.

LINKS

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

Rémy Sigrist, PARI program for A319562

PROG

(PARI) See Links section.

CROSSREFS

Cf. A319561.

Sequence in context: A119428 A241815 A051521 * A171810 A330155 A327759

Adjacent sequences:  A319559 A319560 A319561 * A319563 A319564 A319565

KEYWORD

nonn

AUTHOR

Rémy Sigrist, Sep 23 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 June 5 18:48 EDT 2020. Contains 334854 sequences. (Running on oeis4.)