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.

A373386 Smallest integer m > 1 such that m == m^m (mod 10^(len(m) + n)), where len(m) is the number of digits of m.

Table of values

n a(n)
0 5
1 51
2 751
3 10001
4 100001
5 1000001
6 10000001
7 100000001
8 1000000001

List of values

[5, 51, 751, 10001, 100001, 1000001, 10000001, 100000001, 1000000001]