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.

A037914 a(n) is the least base b>=2 such that the number of distinct digits in the base b representation of n is maximized.

Table of values

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

List of values

[2, 2, 3, 2, 2, 2, 3, 2, 2, 2, 3, 2, 2, 2, 3, 2, 2, 4, 3, 2, 3, 2, 2, 4, 2, 2, 4, 4, 3, 4, 3, 3, 3, 3, 3, 4, 2, 3, 4, 5, 6, 3, 2, 4, 3, 3, 3, 3, 4, 4, 3, 4, 5, 4, 3, 4, 3, 3, 3, 6, 3, 6, 3, 3, 3, 3, 4, 6, 3, 4, 4, 4, 3, 4, 4, 4, 4, 4, 4, 5, 6, 4, 3, 5, 5, 3, 3, 3, 3, 6]