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.

A139425 Smallest number k such that M(n)^2-k*M(n)+1 is prime with M(n)= Mersenne primes =A000668(n).

Table of values

n a(n)
1 1
2 1
3 9
4 3
5 3
6 25
7 7
8 21
9 435
10 241
11 3
12 153
13 151
14 493
15 537
16 2871
17 1713
18 4941
19 4963
20 307
21 28413
22 5035
23 1615
24 43525
25 9973

List of values

[1, 1, 9, 3, 3, 25, 7, 21, 435, 241, 3, 153, 151, 493, 537, 2871, 1713, 4941, 4963, 307, 28413, 5035, 1615, 43525, 9973]