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.

A257080 n multiplied by the least nonzero digit missing from its factorial base representation: a(n) = n * A257079(n).

Table of values

n a(n)
0 0
1 2
2 4
3 6
4 4
5 15
6 12
7 14
8 16
9 18
10 30
11 33
12 12
13 39
14 42
15 45
16 16
17 51
18 18
19 38
20 40
21 42
22 22
23 92
24 48
25 50
26 52
27 54
28 84
29 87
30 60
31 62
32 64
33 66
34 102
35 105
36 108
37 111
38 114
39 117
40 120
41 123
42 84
43 86
44 88
45 90
46 184
47 188
48 48
49 147
50 150
51 153
52 52
53 159
54 162
55 165
56 168
57 171
58 174
59 177
60 60
61 183
62 186
63 189
64 64
65 195
66 66
67 268
68 272
69 276
70 70
71 284
72 72

List of values

[0, 2, 4, 6, 4, 15, 12, 14, 16, 18, 30, 33, 12, 39, 42, 45, 16, 51, 18, 38, 40, 42, 22, 92, 48, 50, 52, 54, 84, 87, 60, 62, 64, 66, 102, 105, 108, 111, 114, 117, 120, 123, 84, 86, 88, 90, 184, 188, 48, 147, 150, 153, 52, 159, 162, 165, 168, 171, 174, 177, 60, 183, 186, 189, 64, 195, 66, 268, 272, 276, 70, 284, 72]