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.

A306112 Largest k such that 2^k has exactly n digits 0 (in base 10), conjectured.

Table of values

n a(n)
0 86
1 229
2 231
3 359
4 283
5 357
6 475
7 476
8 649
9 733
10 648
11 696
12 824
13 634
14 732
15 890
16 895
17 848
18 823
19 929
20 1092
21 1091
22 1239
23 1201
24 1224
25 1210
26 1141
27 1339
28 1240
29 1282
30 1395
31 1449
32 1416
33 1408
34 1616
35 1524
36 1727
37 1725
38 1553
39 1942
40 1907
41 1945
42 1870
43 1724
44 1972
45 1965
46 2075
47 1983
48 2114
49 2257
50 2256

List of values

[86, 229, 231, 359, 283, 357, 475, 476, 649, 733, 648, 696, 824, 634, 732, 890, 895, 848, 823, 929, 1092, 1091, 1239, 1201, 1224, 1210, 1141, 1339, 1240, 1282, 1395, 1449, 1416, 1408, 1616, 1524, 1727, 1725, 1553, 1942, 1907, 1945, 1870, 1724, 1972, 1965, 2075, 1983, 2114, 2257, 2256]