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.

A152721 A prime based vector recursion: a(n)={Prime[n+1],Prime[n],Prime[n-1],-Prime[n-2],...,-1,-1}.

Table of values

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

List of values

[-1, 1, -1, 5, -1, -1, 7, -5, -1, -1, 11, -7, -5, -1, -1, 13, -11, -7, -5, -1, -1, 17, -13, -11, -7, -5, -1, -1, 19, -17, -13, -11, -7, -5, -1, -1, 23, -19, -17, -13, -11, -7, -5, -1, -1, 29, -23, -19, -17, -13, -11, -7, -5, -1, -1, 31, -29, -23, -19, -17, -13, -11, -7, -5]