cp's OEIS Frontend

This is a front-end for the Online Encyclopedia of Integer Sequences, made by Christian Perfect. The idea is to provide OEIS entries in non-ancient HTML, and then to think about how they're presented visually. The source code is on GitHub.

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

This page as a plain text file.
%I A320104 #5 Oct 08 2018 08:07:42
%S A320104 1,1,3,0,20,5,4,15910,2,2,1,2,6,81598,5,366,588,5,202,111603136724,
%T A320104 104,13,246202,0,61,492,
%U A320104 439943534049216658488928456219783705840806353246605875
%N 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).
%C A320104 See A319920 for the square of the modulus of f and additional comments.
%Y A320104 Cf. A319920.
%K A320104 nonn
%O A320104 1,3
%A A320104 _Rémy Sigrist_, Oct 06 2018