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.

A326047 a(n) = gcd(n-A050449(n), n-A050452(n)), where A050449 and A050452 give the sum of divisors of the form 4k+1 and of the form 4k+3, respectively.

Table of values

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

List of values

[1, 1, 2, 1, 1, 1, 6, 1, 1, 2, 10, 1, 1, 1, 3, 1, 1, 1, 18, 2, 1, 1, 22, 1, 1, 2, 1, 3, 1, 12, 30, 1, 1, 2, 1, 1, 1, 1, 1, 2, 1, 4, 42, 1, 3, 1, 46, 1, 1, 1, 3, 2, 1, 4, 1, 1, 1, 2, 58, 6, 1, 1, 2, 1, 1, 4, 66, 2, 1, 4, 70, 1, 1, 2, 2, 3, 1, 4, 78, 2, 1, 2, 82, 2, 1, 1, 3, 1, 1, 6, 7, 1, 1, 1, 1, 1, 1, 1, 14, 1, 1, 12, 102, 2, 9]