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!)
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

%I #8 Sep 25 2018 11:05:44

%S 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,

%T 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,

%U 9,3,7,7,14,10,6,8,6,10,2,9,2,4,5,7,14

%N 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).

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

%H Rémy Sigrist, <a href="/A319562/b319562.txt">Table of n, a(n) for n = 1..10000</a>

%H Rémy Sigrist, <a href="/A319562/a319562.gp.txt">PARI program for A319562</a>

%o (PARI) See Links section.

%Y Cf. A319561.

%K nonn

%O 1,3

%A _Rémy Sigrist_, Sep 23 2018

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 April 25 08:27 EDT 2024. Contains 371964 sequences. (Running on oeis4.)