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.

A180197 a(n) is 2^(p*q) mod r for the n-th odd number with exactly 3 distinct prime factors p < q < r.

Table of values

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

List of values

[1, 10, 8, 2, 9, 5, 12, 16, 15, 10, 8, 5, 27, 7, 1, 12, 23, 2, 8, 17, 9, 12, 2, 2, 9, 10, 9, 11, 8, 1, 29, 14, 4, 2, 23, 18, 42, 11, 9, 3, 12, 12, 6, 5, 12, 8, 2, 37, 1, 64, 2, 48, 18, 13, 62, 16, 14, 15, 56, 66, 1, 33, 19, 15, 4, 16, 33, 52, 32, 9]