|
%I #10 Oct 05 2018 05:39:47
%S 1,1,2,2,5,2,1,1,4,4,3,4,3,3,6,2,3,3,4,5,3,2,1,7,4,8,5,2,1,4,2,7,6,1,
%T 3,9,6,2,1,12,6,2,2,9,7,6,4,11,7,10,3,5,5,5,15,8,9,8,9,7,6,1,6,13,5,8,
%U 6,8,4,9,1,4,4,3,1,11,5,3,14,7,8,7,9,14
%N Let f(1) = 1, f(2) = 1 + i (where i denotes the imaginary unit), f(3) = 2 + i, and for n > 2, f(n+1) is the Gaussian integer in the first quadrant (with positive real part and nonnegative imaginary part) with least modulus and sharing at least one prime factor with f(n-1) but none with f(n) (in case of a tie, minimize the imaginary part); a(n) = the real part of f(n).
%C See A319770 for the square of the modulus of f and additional comments.
%H Rémy Sigrist, <a href="/A319771/b319771.txt">Table of n, a(n) for n = 1..10000</a>
%Y Cf. A319770.
%K nonn
%O 1,3
%A _Rémy Sigrist_, Sep 27 2018
|
