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.

A277079 Least number k for which k^n contains n as a substring and n^k contains k as a substring.

Table of values

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

List of values

[1, 35, 7, 61, 5, 6, 3, 7, 5, 10, 11, 15, 6, 36, 7, 16, 17, 33, 16, 44, 6, 48, 36, 3, 5, 9, 31, 8, 32, 69, 8, 5, 8, 5, 2, 2, 9, 8, 6, 6, 5, 8, 7, 6, 6, 9, 8, 6, 2, 7, 2, 8, 6, 5, 5, 5, 3, 8, 9, 6, 4, 3, 6, 6, 6, 25, 5, 6, 3, 6, 3, 3, 2, 6, 5, 6, 3, 7, 8, 7, 4, 2]