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.

A266568 a(n) = smallest k such that 2^k ends in a string of exactly n nonzero digits.

Table of values

n a(n)
1 0
2 4
3 7
4 13
5 14
6 18
7 50
8 24
9 27
10 31
11 34
12 37
13 68
14 93
15 49
16 51
17 116
18 214
19 131
20 155
21 67
22 72
23 76
24 77
25 81
26 86
27 149
28 498
29 154
30 286
31 359
32 866
33 1225
34 329
35 664
36 129
37 573
38 176
39 655
40 820
41 571
42 434
43 1380
44 475
45 1260
46 2251
47 6015
48 3066
49 1738
50 2136
51 2297
52 432
53 665
54 229
55 1899

List of values

[0, 4, 7, 13, 14, 18, 50, 24, 27, 31, 34, 37, 68, 93, 49, 51, 116, 214, 131, 155, 67, 72, 76, 77, 81, 86, 149, 498, 154, 286, 359, 866, 1225, 329, 664, 129, 573, 176, 655, 820, 571, 434, 1380, 475, 1260, 2251, 6015, 3066, 1738, 2136, 2297, 432, 665, 229, 1899]