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.

A206257 Values of S(1) such that any Mersenne prime with an odd exponent p divides S(p-2), where S(n) == S(n-1)^2 - 2 (mod M(p)).

Table of values

n a(n)
1 14
2 98
3 2702
4 524174
5 940898
6 101687054
7 9034502498
8 19726764302
9 3826890587534
10 86749292044898
11 742397047217294
12 144021200269567502
13 832966693180608098
14 27939370455248878094
15 5420093847118012782734
16 7998146101170906912098
17 1051470266970439230972302

List of values

[14, 98, 2702, 524174, 940898, 101687054, 9034502498, 19726764302, 3826890587534, 86749292044898, 742397047217294, 144021200269567502, 832966693180608098, 27939370455248878094, 5420093847118012782734, 7998146101170906912098, 1051470266970439230972302]