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.

A377655 a(n) is the least prime p such that (2^p - 2)/p == n (mod p), or -1 if there is no such prime p.

Table of values

n a(n)
0 1093
1 2
2 3
3 30577
4 7
5 41
6 13
7 43
8 2633
9 17
10 11
11 23
12 31
13 83
14 233
15 103
16 59
17 97
18 25037
19 53
20 67
21 3323
22 14717

List of values

[1093, 2, 3, 30577, 7, 41, 13, 43, 2633, 17, 11, 23, 31, 83, 233, 103, 59, 97, 25037, 53, 67, 3323, 14717]