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.

A062347 a(n) = (product of first n primes) modulo prime(n+1).

Table of values

n a(n)
0 1
1 2
2 1
3 2
4 1
5 9
6 8
7 18
8 15
9 17
10 19
11 11
12 6
13 26
14 35
15 27
16 15
17 55
18 30
19 24
20 28
21 4
22 47
23 56
24 28
25 28
26 75
27 25
28 105
29 30
30 9
31 52
32 111
33 89
34 46
35 132
36 53
37 97
38 104
39 106
40 42
41 94
42 158
43 184
44 155
45 5
46 6
47 45
48 87
49 78
50 86
51 26
52 120
53 33
54 242
55 66
56 86
57 2
58 214
59 2
60 198
61 127
62 14
63 112
64 7
65 141
66 77
67 309

List of values

[1, 2, 1, 2, 1, 9, 8, 18, 15, 17, 19, 11, 6, 26, 35, 27, 15, 55, 30, 24, 28, 4, 47, 56, 28, 28, 75, 25, 105, 30, 9, 52, 111, 89, 46, 132, 53, 97, 104, 106, 42, 94, 158, 184, 155, 5, 6, 45, 87, 78, 86, 26, 120, 33, 242, 66, 86, 2, 214, 2, 198, 127, 14, 112, 7, 141, 77, 309]

Started in 1964 by Neil J. A. Sloane | Maintained by The OEIS Foundation Inc.

Content is available under The OEIS End-User License Agreement.