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.

A363377 Largest positive integer having n holes that can be made using the fewest possible digits.

Table of values

n a(n)
0 7
1 9
2 8
3 98
4 88
5 988
6 888
7 9888
8 8888
9 98888
10 88888
11 988888
12 888888
13 9888888
14 8888888
15 98888888
16 88888888
17 988888888
18 888888888
19 9888888888
20 8888888888
21 98888888888
22 88888888888
23 988888888888
24 888888888888
25 9888888888888
26 8888888888888
27 98888888888888
28 88888888888888
29 988888888888888

List of values

[7, 9, 8, 98, 88, 988, 888, 9888, 8888, 98888, 88888, 988888, 888888, 9888888, 8888888, 98888888, 88888888, 988888888, 888888888, 9888888888, 8888888888, 98888888888, 88888888888, 988888888888, 888888888888, 9888888888888, 8888888888888, 98888888888888, 88888888888888, 988888888888888]