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.

A353941 Smallest b > 1 such that b^(p-1) == 1 (mod p^8) for p = prime(n).

Table of values

n a(n)
1 257
2 6560
3 110443
4 2387947
5 9236508
6 6826318
7 112184244
8 674273372
9 571782680
10 8827420195
11 46142113101
12 85760131222
13 287369842623
14 120773832179
15 83209719751
16 1684374218587
17 6358345589299
18 6305601215112
19 5800992744105
20 33960226045484
21 56924554232879
22 11856046381401

List of values

[257, 6560, 110443, 2387947, 9236508, 6826318, 112184244, 674273372, 571782680, 8827420195, 46142113101, 85760131222, 287369842623, 120773832179, 83209719751, 1684374218587, 6358345589299, 6305601215112, 5800992744105, 33960226045484, 56924554232879, 11856046381401]