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.

A250209 a(n) = least k such that k * n is in A072226, or 0 if no such k exists.

Table of values

n a(n)
1 2
2 1
3 1
4 1
5 1
6 1
7 1
8 1
9 1
10 1
11 2
12 1
13 1
14 1
15 1
16 1
17 1
18 5
19 1
20 2
21 2
22 1
23 2
24 1
25 6
26 1
27 1
28 2
29 5
30 1
31 1
32 1
33 1
34 1
35 8
36 34
37 8
38 1
39 2
40 1
41 10
42 1
43 2
44 350
45 2
46 1
47 111
48 4
49 1
50 3
51 16
52 4
53 15
54 28
55 3
56 1
57 206
58 3
59 10
60 2
61 1
62 1
63 2
64 3
65 1
66 15
67 637
68 12
69 1
70 4
71 22
72 17
73 104
74 4
75 2
76 1012
77 1
78 1

List of values

[2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 2, 1, 1, 1, 1, 1, 1, 5, 1, 2, 2, 1, 2, 1, 6, 1, 1, 2, 5, 1, 1, 1, 1, 1, 8, 34, 8, 1, 2, 1, 10, 1, 2, 350, 2, 1, 111, 4, 1, 3, 16, 4, 15, 28, 3, 1, 206, 3, 10, 2, 1, 1, 2, 3, 1, 15, 637, 12, 1, 4, 22, 17, 104, 4, 2, 1012, 1, 1]