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.

A199970 a(n) = the smallest number m with the smallest non-divisor n such that 1 or 0 if no such m exists.

Table of values

n a(n)
1 0
2 3
3 4
4 6
5 12
6 0
7 60
8 420
9 840
10 0
11 2520
12 0
13 27720
14 0
15 0
16 360360
17 720720
18 0
19 12252240
20 0
21 0
22 0
23 232792560
24 0
25 5354228880
26 0
27 26771144400
28 0
29 80313433200
30 0
31 2329089562800
32 72201776446800
33 0
34 0
35 0
36 0
37 144403552893600
38 0
39 0
40 0
41 5342931457063200
42 0
43 219060189739591200

List of values

[0, 3, 4, 6, 12, 0, 60, 420, 840, 0, 2520, 0, 27720, 0, 0, 360360, 720720, 0, 12252240, 0, 0, 0, 232792560, 0, 5354228880, 0, 26771144400, 0, 80313433200, 0, 2329089562800, 72201776446800, 0, 0, 0, 0, 144403552893600, 0, 0, 0, 5342931457063200, 0, 219060189739591200]

Started in 1964 by Neil J. A. Sloane | Maintained by The OEIS Foundation Inc.

Content is available under The OEIS End-User License Agreement.