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.

A220093 a(n) is the smallest odd positive integer > 1 that makes the composite number 2*n-a(n)*p1 divisible by p2, where p1 and p2 are the smallest and 2nd smallest odd prime numbers that are not factors of n. When no such odd positive integer exists, a(n)=0.

Table of values

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

List of values

[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 3, 0, 0, 0, 0, 3, 7, 0, 0, 9, 0, 0, 11, 0, 9, 3, 0, 11, 0, 0, 3, 7, 0, 0, 9, 0, 7, 21, 0, 9, 3, 0, 11, 3, 5, 3, 7, 0, 0, 9, 13, 7, 11, 0, 9, 3, 0, 11, 27, 0, 3, 7, 0, 0, 9, 5, 7, 11, 0, 9, 3, 0, 11, 9, 17, 3, 7, 5]