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.

A255832 Least m > 0 such that gcd(m^(2n+1)+2, (m+1)^(2n+1)+2) > 1.

Table of values

n a(n)
1 51
2 40333
3 434
4 16
5 1234
6 78607
7 8310
8 817172
9 473
10 116
11 22650
12 736546059
13 22
14 1080982
15 252
16 7809
17 644
18 1786225573

List of values

[51, 40333, 434, 16, 1234, 78607, 8310, 817172, 473, 116, 22650, 736546059, 22, 1080982, 252, 7809, 644, 1786225573]