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.

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

Table of values

n a(n)
1 1025
2 59048
3 3626068
4 135967276
5 1509748675
6 14149342837
7 109522148350
8 649340249056
9 191730243526
10 45941644105613
11 6359301533362
12 24287026146320
13 265934493600922
14 927939012431924
15 1377672497815095
16 4440230734662684
17 10400007512898615
18 12198961352308417

List of values

[1025, 59048, 3626068, 135967276, 1509748675, 14149342837, 109522148350, 649340249056, 191730243526, 45941644105613, 6359301533362, 24287026146320, 265934493600922, 927939012431924, 1377672497815095, 4440230734662684, 10400007512898615, 12198961352308417]