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.

A278509 a(n) = 3^{number of primes congruent to 3 modulo 4 dividing n (with multiplicity)}.

Table of values

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

List of values

[1, 1, 3, 1, 1, 3, 3, 1, 9, 1, 3, 3, 1, 3, 3, 1, 1, 9, 3, 1, 9, 3, 3, 3, 1, 1, 27, 3, 1, 3, 3, 1, 9, 1, 3, 9, 1, 3, 3, 1, 1, 9, 3, 3, 9, 3, 3, 3, 9, 1, 3, 1, 1, 27, 3, 3, 9, 1, 3, 3, 1, 3, 27, 1, 1, 9, 3, 1, 9, 3, 3, 9, 1, 1, 3, 3, 9, 3, 3, 1, 81, 1, 3, 9, 1, 3, 3, 3, 1, 9, 3, 3, 9, 3, 3, 3, 1, 9, 27, 1, 1, 3, 3, 1, 9, 1, 3, 27, 1, 3, 3, 3, 1, 9, 3, 1, 9, 3, 3, 3]