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.

A182750 a(n) = the largest multiple of n with n digits and exactly n divisors; a(n) = 0 if no such number exists.

Table of values

n a(n)
1 1
2 0
3 0
4 0
5 0
6 0
7 0
8 99999992
9 998117649
10 0
11 25937424601
12 999999999924
13 0
14 0
15 0
16 9999999999999872
17 0
18 999999999999999252
19 0
20 99999999999999999440
21 0
22 0
23 0
24 999999999999999999999456
25 9999450940359923567250625
26 0
27 999999999997420003910299449
28 9999999999999999999999972416
29 0
30 0
31 0

List of values

[1, 0, 0, 0, 0, 0, 0, 99999992, 998117649, 0, 25937424601, 999999999924, 0, 0, 0, 9999999999999872, 0, 999999999999999252, 0, 99999999999999999440, 0, 0, 0, 999999999999999999999456, 9999450940359923567250625, 0, 999999999997420003910299449, 9999999999999999999999972416, 0, 0, 0]