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.

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

Table of values

n a(n)
1 1
2 51
3 57
4 101
5 151
6 176
7 201
8 301
9 351
10 401
11 501
12 551
13 576
14 601
15 625
16 701
17 751
18 801
19 901
20 951
21 976
22 1001
23 1376
24 2001
25 2057
26 2751
27 3001
28 4001
29 4193
30 4751
31 5001
32 5376
33 6001
34 6249
35 6751
36 7001
37 8001
38 8751
39 9001
40 9375
41 9376
42 10001
43 10751
44 11001
45 12001
46 13001

List of values

[1, 51, 57, 101, 151, 176, 201, 301, 351, 401, 501, 551, 576, 601, 625, 701, 751, 801, 901, 951, 976, 1001, 1376, 2001, 2057, 2751, 3001, 4001, 4193, 4751, 5001, 5376, 6001, 6249, 6751, 7001, 8001, 8751, 9001, 9375, 9376, 10001, 10751, 11001, 12001, 13001]