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.

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

Table of values

n a(n)
0 27
1 43
2 77
3 61
4 69
5 119
6 115
7 158
8 159
9 168
10 216
11 232
12 202
13 198
14 244
15 270
16 229
17 274
18 241
19 273
20 364
21 283
22 413
23 298
24 408
25 341
26 378
27 431
28 404
29 403
30 465
31 483
32 472
33 454
34 467
35 508
36 540
37 575
38 485
39 576
40 511
41 623
42 538
43 515
44 560
45 655
46 647
47 661
48 648
49 639
50 752

List of values

[27, 43, 77, 61, 69, 119, 115, 158, 159, 168, 216, 232, 202, 198, 244, 270, 229, 274, 241, 273, 364, 283, 413, 298, 408, 341, 378, 431, 404, 403, 465, 483, 472, 454, 467, 508, 540, 575, 485, 576, 511, 623, 538, 515, 560, 655, 647, 661, 648, 639, 752]