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.

A185279 a(n) = number of ways that one can write n as the sum of two positive integers such that i) the integers are relatively prime to n but ii) the integers are not themselves prime.

Table of values

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

List of values

[0, 1, 0, 0, 1, 0, 1, 0, 1, 1, 1, 0, 2, 0, 1, 1, 2, 0, 3, 0, 1, 1, 3, 0, 3, 1, 1, 1, 5, 0, 6, 0, 2, 2, 3, 1, 7, 0, 3, 1, 8, 0, 9, 1, 1, 2, 9, 0, 8, 1, 3, 2, 11, 0, 7, 1, 4, 3, 13, 0, 14, 1, 3, 4, 8, 1, 15, 1, 6, 1, 16, 0, 17, 3, 2, 4, 11, 1, 18, 0, 7, 4, 19, 0]