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.

A137795 Smallest positive m such that m*n is free of prime gaps in canonical factorization.

Table of values

n a(n)
1 1
2 1
3 1
4 1
5 1
6 1
7 1
8 1
9 1
10 3
11 1
12 1
13 1
14 15
15 1
16 1
17 1
18 1
19 1
20 3
21 5
22 105
23 1
24 1
25 1
26 1155
27 1
28 15
29 1
30 1
31 1
32 1
33 35
34 15015
35 1
36 1
37 1
38 255255
39 385
40 3
41 1
42 5
43 1
44 105
45 1
46 4849845
47 1
48 1
49 1
50 3
51 5005
52 1155
53 1
54 1
55 7
56 15
57 85085
58 111546435
59 1
60 1
61 1
62 3234846615
63 5
64 1
65 77
66 35
67 1
68 15015
69 1616615
70 3
71 1
72 1

List of values

[1, 1, 1, 1, 1, 1, 1, 1, 1, 3, 1, 1, 1, 15, 1, 1, 1, 1, 1, 3, 5, 105, 1, 1, 1, 1155, 1, 15, 1, 1, 1, 1, 35, 15015, 1, 1, 1, 255255, 385, 3, 1, 5, 1, 105, 1, 4849845, 1, 1, 1, 3, 5005, 1155, 1, 1, 7, 15, 85085, 111546435, 1, 1, 1, 3234846615, 5, 1, 77, 35, 1, 15015, 1616615, 3, 1, 1]