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.

A057205 Primes congruent to 3 modulo 4 generated recursively: a(n) = Min_{p, prime; p mod 4 = 3; p|4Q-1}, where Q is the product of all previous terms in the sequence. The initial term is 3.

Table of values

n a(n)
1 3
2 11
3 131
4 17291
5 298995971
6 8779
7 594359
8 59
9 151
10 983
11 19
12 38851089348584904271503421339
13 2359886893253830912337243172544609142020402559023
14 823818731
15 2287
16 7
17 9680188101680097499940803368598534875039120224550520256994576755856639426217960921548886589841784188388581120523
18 163
19 83
20 1471
21 34211
22 2350509754734287
23 23567

List of values

[3, 11, 131, 17291, 298995971, 8779, 594359, 59, 151, 983, 19, 38851089348584904271503421339, 2359886893253830912337243172544609142020402559023, 823818731, 2287, 7, 9680188101680097499940803368598534875039120224550520256994576755856639426217960921548886589841784188388581120523, 163, 83, 1471, 34211, 2350509754734287, 23567]

Started in 1964 by Neil J. A. Sloane | Maintained by The OEIS Foundation Inc.

Content is available under The OEIS End-User License Agreement.