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.

A373206 Numbers m such that m^m == m (mod 10^(len(m) + 2)), where len(m) is the number of digits of m (A055642).

Table of values

n a(n)
1 1
2 751
3 1001
4 2001
5 2751
6 3001
7 4001
8 5001
9 5376
10 6001
11 6751
12 7001
13 8001
14 9001
15 10001
16 18751
17 20001
18 30001
19 40001
20 50001
21 58751
22 60001
23 69376
24 70001
25 80001
26 90001
27 98751
28 100001
29 110001
30 120001
31 130001
32 138751
33 140001
34 150001
35 160001
36 170001
37 180001
38 190001

List of values

[1, 751, 1001, 2001, 2751, 3001, 4001, 5001, 5376, 6001, 6751, 7001, 8001, 9001, 10001, 18751, 20001, 30001, 40001, 50001, 58751, 60001, 69376, 70001, 80001, 90001, 98751, 100001, 110001, 120001, 130001, 138751, 140001, 150001, 160001, 170001, 180001, 190001]