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.

A281747 Smallest b > 1 such that p = prime(n) satisfies b^(p-1) == 1 (mod p^p).

Table of values

n a(n)
1 5
2 26
3 1068
4 82681
5 5392282366
6 11356596271444
7 34451905517028761171
8 340625514346676110671584
9 308318432223607315018221180590
10 8566187045843934976180705488213013173127
11 1099862052702774330481800364074681495062836757
12 8170421001593885871548404108552563632485969048059688187

List of values

[5, 26, 1068, 82681, 5392282366, 11356596271444, 34451905517028761171, 340625514346676110671584, 308318432223607315018221180590, 8566187045843934976180705488213013173127, 1099862052702774330481800364074681495062836757, 8170421001593885871548404108552563632485969048059688187]

Started in 1964 by Neil J. A. Sloane | Maintained by The OEIS Foundation Inc.

Content is available under The OEIS End-User License Agreement.