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.

A123060 Least positive integer k such that n has the same number of characters in base k and in Roman numeral representation, or 0 if no such k exists.

Table of values

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

List of values

[1, 1, 1, 3, 6, 3, 2, 2, 4, 11, 4, 3, 2, 3, 4, 3, 0, 2, 3, 5, 3, 0, 2, 0, 3, 0, 2, 0, 3, 4, 3, 0, 2, 0, 3, 0, 2, 0, 0, 7, 4, 3, 0, 3, 4, 3, 0, 2, 3, 51, 8, 4, 3, 4, 8, 4, 3, 0, 4, 8, 4, 3, 0, 3, 5, 3, 0, 0, 3, 5, 3, 0, 0, 0, 3, 0, 0, 2, 0, 3, 3, 0, 2, 0, 3, 0]