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.

A245525 Unique integer r with -prime(n)/2 < r <= prime(n)/2 such that p(n) == r (mod prime(n)), where p(.) is the partition function given by A000041.

Table of values

n a(n)
1 1
2 -1
3 -2
4 -2
5 -4
6 -2
7 -2
8 3
9 7
10 13
11 -6
12 3
13 19
14 6
15 -12
16 19
17 2
18 19
19 21
20 -12
21 -11
22 -25
23 10
24 -27
25 18
26 12
27 23
28 -27
29 -13
30 -46
31 -16
32 -35
33 5
34 -61
35 -17
36 8
37 -29
38 -65
39 -44
40 -30
41 12
42 -40
43 40
44 -95
45 90
46 88
47 53
48 93
49 97
50 -42
51 -47
52 47
53 2
54 117
55 -16
56 34
57 27
58 51
59 -11
60 108
61 -24
62 115
63 -29
64 30
65 -32
66 -90
67 -87
68 141
69 24
70 131
71 -166
72 -115
73 -96
74 -111
75 84
76 -191
77 163
78 -156
79 115
80 78

List of values

[1, -1, -2, -2, -4, -2, -2, 3, 7, 13, -6, 3, 19, 6, -12, 19, 2, 19, 21, -12, -11, -25, 10, -27, 18, 12, 23, -27, -13, -46, -16, -35, 5, -61, -17, 8, -29, -65, -44, -30, 12, -40, 40, -95, 90, 88, 53, 93, 97, -42, -47, 47, 2, 117, -16, 34, 27, 51, -11, 108, -24, 115, -29, 30, -32, -90, -87, 141, 24, 131, -166, -115, -96, -111, 84, -191, 163, -156, 115, 78]