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.

A170821 Let p = n-th prime; a(n) = smallest k >= 0 such that 4k == 3 mod p.

Table of values

n a(n)
2 0
3 2
4 6
5 9
6 4
7 5
8 15
9 18
10 8
11 24
12 10
13 11
14 33
15 36
16 14
17 45
18 16
19 51
20 54
21 19
22 60
23 63
24 23
25 25
26 26
27 78
28 81
29 28
30 29
31 96
32 99
33 35
34 105
35 38
36 114
37 40
38 123
39 126
40 44
41 135
42 46
43 144
44 49
45 50
46 150
47 159
48 168
49 171
50 58
51 59
52 180
53 61
54 189
55 65
56 198
57 68
58 204
59 70
60 71
61 213
62 74
63 231
64 234
65 79
66 80
67 249
68 85
69 261

List of values

[0, 2, 6, 9, 4, 5, 15, 18, 8, 24, 10, 11, 33, 36, 14, 45, 16, 51, 54, 19, 60, 63, 23, 25, 26, 78, 81, 28, 29, 96, 99, 35, 105, 38, 114, 40, 123, 126, 44, 135, 46, 144, 49, 50, 150, 159, 168, 171, 58, 59, 180, 61, 189, 65, 198, 68, 204, 70, 71, 213, 74, 231, 234, 79, 80, 249, 85, 261]

Started in 1964 by Neil J. A. Sloane | Maintained by The OEIS Foundation Inc.

Content is available under The OEIS End-User License Agreement.