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.

A337535 For n>1, a(n) is the least base b>2 such that the digits of n in base b contain the digit b-1; a(1)=1.

Table of values

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

List of values

[1, 3, 4, 5, 3, 3, 3, 3, 5, 11, 3, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 4, 4, 3, 4, 4, 3, 3, 3, 3, 37, 19, 3, 4, 41, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 41, 83, 3, 5, 43]