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.

A353214 a(n) = 2^A007013(4) mod prime(n); the last term of this sequences is when a(n) = 1.

Table of values

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

List of values

[0, -1, -2, 2, -4, -2, -8, 2, -5, -2, 4, -2, 5, 2, -11, -20, -22, 6, -23, -21, 2, -3, -16, -25, -31, 40, 19, -29, -2, -2, 2, -49, 19, 68, -56, -23, -59, 45, 29, -2, 62, 63, 27, 54, -2, -22, -46, 28, -85, -2, -29, 17, -113, -4, -128, -65, -46, 20, -51, -98, -64]