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.

A262807 a(n) = (Product_{k=1..n} prime(k+1)) mod (Sum_{k=1..n} prime(k+1)) where prime(k) is the k-th prime number.

Table of values

n a(n)
1 0
2 7
3 0
4 11
5 0
6 7
7 45
8 91
9 24
10 55
11 0
12 113
13 93
14 175
15 308
16 153
17 414
18 395
19 273
20 355
21 609
22 779
23 558
24 23
25 0
26 843
27 962
28 185
29 0
30 547
31 1634
32 21
33 170
34 1149
35 1455
36 2483
37 1830
38 2275
39 2865
40 1989
41 0
42 1515
43 1211
44 2013
45 1105
46 403
47 2733
48 819
49 0
50 4011
51 0
52 1457
53 4278
54 1155
55 391
56 1717
57 2596
58 2163
59 0
60 5985

List of values

[0, 7, 0, 11, 0, 7, 45, 91, 24, 55, 0, 113, 93, 175, 308, 153, 414, 395, 273, 355, 609, 779, 558, 23, 0, 843, 962, 185, 0, 547, 1634, 21, 170, 1149, 1455, 2483, 1830, 2275, 2865, 1989, 0, 1515, 1211, 2013, 1105, 403, 2733, 819, 0, 4011, 0, 1457, 4278, 1155, 391, 1717, 2596, 2163, 0, 5985]