Let f(1) = 1 + i (where i denotes the imaginary unit) and for n > 0, f(n+1) is the Gaussian prime in the first quadrant (with positive real part and nonnegative imaginary part) with least modulus that divides 1 + Product_{k=1..n} f(k) (in case of a tie minimize the imaginary part); a(n) is the square of the modulus of f(n).
A319920
Let f(1) = 1 + i (where i denotes the imaginary unit) and for n > 0, f(n+1) is the Gaussian prime in the first quadrant (with positive real part and nonnegative imaginary part) with least modulus that divides 1 + Product_{k=1..n} f(k) (in case of a tie minimize the imaginary part); a(n) is the square of the modulus of f(n).
Terms
- a(0) =2a(1) =5a(2) =13a(3) =9a(4) =1129a(5) =29a(6) =17a(7) =651250309a(8) =5a(9) =13a(10) =17a(11) =29a(12) =37a(13) =16767128453a(14) =41a(15) =133981a(16) =2236369a(17) =61a(18) =45293a(20) =12041a(21) =653a(23) =121a(24) =11821a(25) =779353
External references
- oeis: A319920