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.

A078239 a(n) = smallest multiple of n using only prime digits, with a(n) = 0 if there are none.

Table of values

n a(n)
1 2
2 2
3 3
4 32
5 5
6 72
7 7
8 32
9 27
10 0
11 22
12 72
13 52
14 252
15 75
16 32
17 255
18 72
19 57
20 0
21 252
22 22
23 23
24 72
25 25
26 52
27 27
28 252
29 232
30 0
31 372
32 32
33 33
34 272
35 35
36 72
37 37
38 532
39 273
40 0
41 533
42 252
43 2322
44 352
45 225
46 322
47 235
48 2352
49 735
50 0
51 255
52 52
53 53
54 2322
55 55
56 2352
57 57
58 232
59 2537
60 0
61 732
62 372
63 252
64 2752
65 325
66 2772
67 335
68 272

List of values

[2, 2, 3, 32, 5, 72, 7, 32, 27, 0, 22, 72, 52, 252, 75, 32, 255, 72, 57, 0, 252, 22, 23, 72, 25, 52, 27, 252, 232, 0, 372, 32, 33, 272, 35, 72, 37, 532, 273, 0, 533, 252, 2322, 352, 225, 322, 235, 2352, 735, 0, 255, 52, 53, 2322, 55, 2352, 57, 232, 2537, 0, 732, 372, 252, 2752, 325, 2772, 335, 272]