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.

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

Table of values

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

List of values

[2, 2, 3, 1, 3, 1, 2, 2, 1, 2, 1, 6, 3, 4, 2, 1, 3, 2, 2, 1, 3, 7, 2, 1, 8, 4, 2, 10, 5, 6, 1, 3, 2, 1, 2, 5, 1, 3, 10, 7, 2, 1, 2, 2, 2, 8, 10, 2, 4, 3, 2, 1, 8, 15, 2, 5, 2, 7, 1, 2, 10, 1, 4, 6, 12, 3, 8, 1, 6, 2, 8, 3, 8, 9, 1, 11, 4, 3, 1, 2, 7, 2, 15, 10, 8]