

A320104


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 imaginary part of f(n).


1



1, 1, 3, 0, 20, 5, 4, 15910, 2, 2, 1, 2, 6, 81598, 5, 366, 588, 5, 202, 111603136724, 104, 13, 246202, 0, 61, 492, 439943534049216658488928456219783705840806353246605875
(list;
graph;
refs;
listen;
history;
text;
internal format)




