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.

A364089 a(n) is the greatest k such that the base-n digits of 2^k are all distinct.

Table of values

n a(n)
2 1
3 1
4 3
5 4
6 5
7 8
8 5
9 10
10 29
11 19
12 19
13 19
14 16
15 18
16 7
17 43
18 41
19 37
20 45
21 39
22 55
23 33
24 43
25 60
26 35
27 61
28 56
29 50
30 44
31 69
32 9
33 64
34 44
35 80
36 43
37 88
38 53
39 71
40 56
41 68
42 59
43 78
44 76
45 74
46 95
47 109
48 111
49 81
50 86
51 136
52 117
53 75
54 98
55 83
56 84
57 99
58 104
59 116
60 95
61 118
62 60
63 81
64 11
65 119
66 119
67 172
68 140
69 97
70 105
71 113
72 93
73 122
74 92

List of values

[1, 1, 3, 4, 5, 8, 5, 10, 29, 19, 19, 19, 16, 18, 7, 43, 41, 37, 45, 39, 55, 33, 43, 60, 35, 61, 56, 50, 44, 69, 9, 64, 44, 80, 43, 88, 53, 71, 56, 68, 59, 78, 76, 74, 95, 109, 111, 81, 86, 136, 117, 75, 98, 83, 84, 99, 104, 116, 95, 118, 60, 81, 11, 119, 119, 172, 140, 97, 105, 113, 93, 122, 92]