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.

A074162 a(1) = 1; a(n) = smallest multiple of n (>n) using all nonprime digits (1,4,6,8,9 and 0) if n is a prime else using all prime digits and 1 if n is composite; or 0 if no such number exists.

Table of values

n a(n)
1 1
2 4
3 6
4 12
5 10
6 12
7 14
8 32
9 27
10 0
11 44
12 72
13 91
14 112
15 75
16 32
17 68
18 72
19 114
20 0
21 231
22 132
23 46
24 72
25 75
26 52
27 135
28 112
29 116
30 0
31 186
32 352
33 132
34 272
35 175
36 72
37 111
38 152
39 117
40 0
41 164
42 252
43 86
44 132
45 135
46 322
47 94
48 1152
49 735
50 0
51 153
52 312
53 106
54 1512
55 275
56 112
57 171
58 232
59 118
60 0
61 488

List of values

[1, 4, 6, 12, 10, 12, 14, 32, 27, 0, 44, 72, 91, 112, 75, 32, 68, 72, 114, 0, 231, 132, 46, 72, 75, 52, 135, 112, 116, 0, 186, 352, 132, 272, 175, 72, 111, 152, 117, 0, 164, 252, 86, 132, 135, 322, 94, 1152, 735, 0, 153, 312, 106, 1512, 275, 112, 171, 232, 118, 0, 488]