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.

A364049 a(n) is the least k such that the base-n digits of 2^k are not all distinct.

Table of values

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

List of values

[2, 2, 4, 5, 6, 3, 6, 11, 16, 14, 11, 12, 8, 4, 8, 15, 16, 12, 16, 18, 9, 17, 15, 14, 24, 13, 16, 15, 10, 5, 10, 19, 24, 14, 21, 15, 18, 15, 19, 17, 17, 28, 18, 12, 24, 23, 31, 24, 31, 20, 26, 44, 35, 33, 25, 18, 36, 14, 14, 18, 12, 6, 12, 23, 45, 37, 38, 24, 20, 35, 36, 26, 51, 31, 33, 47, 34, 34]

Started in 1964 by Neil J. A. Sloane | Maintained by The OEIS Foundation Inc.

Content is available under The OEIS End-User License Agreement.