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.

A320523 Smallest m > 1 such that either n^m == n (mod 25) or n^m == 0 (mod 25).

Table of values

n a(n)
1 2
2 21
3 21
4 11
5 2
6 6
7 5
8 21
9 11
10 2
11 6
12 21
13 21
14 11
15 2
16 6
17 21
18 5
19 11
20 2
21 6
22 21
23 21
24 3
25 2
26 2
27 21
28 21
29 11
30 2
31 6
32 5
33 21
34 11
35 2
36 6
37 21
38 21
39 11
40 2
41 6
42 21
43 5
44 11
45 2
46 6
47 21
48 21
49 3
50 2
51 2
52 21
53 21
54 11
55 2
56 6
57 5
58 21
59 11
60 2
61 6
62 21
63 21
64 11
65 2
66 6
67 21
68 5
69 11
70 2
71 6
72 21
73 21
74 3
75 2

List of values

[2, 21, 21, 11, 2, 6, 5, 21, 11, 2, 6, 21, 21, 11, 2, 6, 21, 5, 11, 2, 6, 21, 21, 3, 2, 2, 21, 21, 11, 2, 6, 5, 21, 11, 2, 6, 21, 21, 11, 2, 6, 21, 5, 11, 2, 6, 21, 21, 3, 2, 2, 21, 21, 11, 2, 6, 5, 21, 11, 2, 6, 21, 21, 11, 2, 6, 21, 5, 11, 2, 6, 21, 21, 3, 2]

Started in 1964 by Neil J. A. Sloane | Maintained by The OEIS Foundation Inc.

Content is available under The OEIS End-User License Agreement.