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.

A218467 A variant of the Euclid-Mullin sequence A000945: a(1) = 2, a(n+1) is smallest prime factor congruent to 3 (mod 4) of Product_{k=1..n} a(k) + 1.

Table of values

n a(n)
1 2
2 3
3 7
4 43
5 139
6 50207
7 23
8 10651
9 563
10 11
11 19
12 363303615453958067659
13 787
14 2803
15 3261639461817858097484047657974700766171
16 448513341328399688966874038187266281752082128599801650127
17 89724193529143

List of values

[2, 3, 7, 43, 139, 50207, 23, 10651, 563, 11, 19, 363303615453958067659, 787, 2803, 3261639461817858097484047657974700766171, 448513341328399688966874038187266281752082128599801650127, 89724193529143]