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.

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

Table of values

n a(n)
1 1
2 2
3 2
4 3
5 27
6 2
7 1
8 19953
9 1
10 3
11 4
12 5
13 1
14 100543
15 4
16 5
17 1375
18 6
19 67
20 100129349439
21 35
22 22
23 7200537
24 11
25 90
26 733
27 1653333714972695690441280142887575811965481459539542336

List of values

[1, 2, 2, 3, 27, 2, 1, 19953, 1, 3, 4, 5, 1, 100543, 4, 5, 1375, 6, 67, 100129349439, 35, 22, 7200537, 11, 90, 733, 1653333714972695690441280142887575811965481459539542336]