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.

A227071 Let s(m) = the set of k > 0 such that k^m ends with k. Then a(n) = least m such that s(m) = s(n).

Table of values

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

List of values

[1, 2, 3, 2, 5, 6, 3, 2, 9, 2, 11, 2, 5, 2, 3, 6, 17, 2, 3, 2, 21, 2, 3, 2, 9, 26, 3, 2, 5, 2, 11, 2, 33, 2, 3, 6, 5, 2, 3, 2, 41, 2, 3, 2, 5, 6, 3, 2, 17, 2, 51, 2, 5, 2, 3, 6, 9, 2, 3, 2, 21, 2, 3, 2, 65, 6, 3, 2, 5, 2, 11, 2, 9, 2, 3, 26, 5, 2, 3, 2, 81, 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.