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.

A072565 a(n) = prime(n+1)*prime(n+2)+1 mod prime(n), where prime(n) is the n-th prime.

Table of values

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

List of values

[0, 0, 3, 4, 2, 12, 13, 3, 3, 17, 30, 25, 13, 41, 26, 49, 17, 0, 25, 17, 61, 41, 2, 8, 25, 13, 25, 13, 73, 27, 41, 49, 25, 121, 17, 73, 61, 41, 73, 49, 25, 121, 13, 25, 29, 90, 193, 25, 13, 41, 49, 25, 161, 73, 73, 49, 17, 61, 25, 25, 241, 253, 25, 13, 73, 281, 97, 121, 13]

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

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