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.

A246269 a(1) = 1, a(p(k)) = p(k+1) mod 4 for k-th prime p(k) and a(u * v) = a(u) * a(v) for u, v > 0.

Table of values

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

List of values

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