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

Table of values

n a(n)
1 1
2 1
3 3
4 0
5 20
6 5
7 4
8 15910
9 2
10 2
11 1
12 2
13 6
14 81598
15 5
16 366
17 588
18 5
19 202
20 111603136724
21 104
22 13
23 246202
24 0
25 61
26 492
27 439943534049216658488928456219783705840806353246605875

List of values

[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]