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.

A068190 Largest number whose digit product equals n; a(n)=0 if no such number exists, e.g., when n has a prime factor larger than 7; no digit=1 is permitted to avoid an infinite number of solutions.

Table of values

n a(n)
1 0
2 2
3 3
4 22
5 5
6 32
7 7
8 222
9 33
10 52
11 0
12 322
13 0
14 72
15 53
16 2222
17 0
18 332
19 0
20 522
21 73
22 0
23 0
24 3222
25 55
26 0
27 333
28 722
29 0
30 532
31 0
32 22222
33 0
34 0
35 75
36 3322
37 0
38 0
39 0
40 5222
41 0
42 732
43 0
44 0
45 533
46 0
47 0
48 32222
49 77
50 552
51 0
52 0
53 0
54 3332
55 0
56 7222
57 0
58 0
59 0
60 5322
61 0
62 0
63 733
64 222222
65 0
66 0
67 0
68 0
69 0

List of values

[0, 2, 3, 22, 5, 32, 7, 222, 33, 52, 0, 322, 0, 72, 53, 2222, 0, 332, 0, 522, 73, 0, 0, 3222, 55, 0, 333, 722, 0, 532, 0, 22222, 0, 0, 75, 3322, 0, 0, 0, 5222, 0, 732, 0, 0, 533, 0, 0, 32222, 77, 552, 0, 0, 0, 3332, 0, 7222, 0, 0, 0, 5322, 0, 0, 733, 222222, 0, 0, 0, 0, 0]