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.

A352040 a(n) is the least number k such that 2^k contains each of the 10 digits at least n times.

Table of values

n a(n)
1 68
2 88
3 119
4 200
5 209
6 246
7 291
8 318
9 396
10 398
11 443
12 443
13 495
14 586
15 592
16 622
17 646
18 707
19 758
20 758
21 813
22 866
23 875
24 903
25 923
26 1001
27 1022
28 1022
29 1105
30 1111
31 1111
32 1231
33 1243
34 1245
35 1327
36 1342
37 1419
38 1453
39 1453
40 1454
41 1534
42 1536
43 1537
44 1626
45 1676
46 1699
47 1699
48 1763

List of values

[68, 88, 119, 200, 209, 246, 291, 318, 396, 398, 443, 443, 495, 586, 592, 622, 646, 707, 758, 758, 813, 866, 875, 903, 923, 1001, 1022, 1022, 1105, 1111, 1111, 1231, 1243, 1245, 1327, 1342, 1419, 1453, 1453, 1454, 1534, 1536, 1537, 1626, 1676, 1699, 1699, 1763]