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.

A267000 a(n) is the smallest m such that A001414(m)=n and ((m=0) mod n) and m/n is both squarefree and prime to n, or 0 if no such m exists.

Table of values

n a(n)
2 2
3 3
4 4
5 5
6 0
7 7
8 0
9 0
10 30
11 11
12 60
13 13
14 70
15 105
16 240
17 17
18 0
19 19
20 220
21 231
22 0
23 23
24 0
25 650
26 286
27 1755
28 476
29 29
30 2730
31 31
32 1824
33 627
34 3570
35 805
36 4788
37 37
38 646
39 897
40 1160
41 41
42 8778
43 43
44 1276
45 11385
46 8970
47 47
48 1776
49 36309
50 10850
51 1581
52 41860
53 53
54 2322
55 4070
56 2408
57 45885
58 16530
59 59

List of values

[2, 3, 4, 5, 0, 7, 0, 0, 30, 11, 60, 13, 70, 105, 240, 17, 0, 19, 220, 231, 0, 23, 0, 650, 286, 1755, 476, 29, 2730, 31, 1824, 627, 3570, 805, 4788, 37, 646, 897, 1160, 41, 8778, 43, 1276, 11385, 8970, 47, 1776, 36309, 10850, 1581, 41860, 53, 2322, 4070, 2408, 45885, 16530, 59]