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.

A245595 Unique integer r with -prime(n)/2 < r <= prime(n)/2 such that S(n) == r (mod prime(n)), where S(n) is the large Schroeder number A006318(n).

Table of values

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

List of values

[0, 0, 2, -1, -2, -1, 7, -5, -5, 11, 10, -11, 11, 12, 2, 17, -2, 19, -15, -26, 33, 17, -22, -11, 18, 8, 18, -27, 17, 51, -37, -34, 28, -4, 66, -37, -69, -58, 45, -81, -20, -86, -19, 17, -12, -30, 35, -32, 5, -11, -8, -45, 12, -111, -28, -71, 76, 59, 102, -25]