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.

A280717 Given a prime number p, let b = -p and c = p^2. Assuming that the polynomial P(x) := x^2+b*x+c takes at least one prime value for some positive integer x we define the next term of the sequence to be the maximal element in the set S := {P(x) : x is an integer, 0 < x < p, and P(x) is a prime number}. The first term of the present sequence is p=3.

Table of values

n a(n)
1 3
2 7
3 43
4 1693
5 2864557
6 8205572225569
7 67331415548799635795058613
8 4533519519805137360312930667312809111343819483374997
9 20552799236454203238557860425684304712780972342513397945121797314302926172950212696842909492430773376197

List of values

[3, 7, 43, 1693, 2864557, 8205572225569, 67331415548799635795058613, 4533519519805137360312930667312809111343819483374997, 20552799236454203238557860425684304712780972342513397945121797314302926172950212696842909492430773376197]