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.

A072525 a(0) = 1; a(n+1) is smallest composite number > a(n) such that a(n) + a(n+1) is prime.

Table of values

n a(n)
0 1
1 4
2 9
3 10
4 21
5 22
6 25
7 28
8 33
9 34
10 39
11 40
12 49
13 52
14 55
15 58
16 69
17 70
18 81
19 82
20 85
21 88
22 91
23 100
24 111
25 112
26 115
27 118
28 121
29 130
30 133
31 136
32 141
33 142
34 165
35 166
36 171
37 176
38 177
39 182
40 185
41 188
42 195
43 202
44 207
45 212
46 219
47 220
48 237
49 242
50 245
51 246
52 253
53 256
54 265
55 276
56 287
57 290

List of values

[1, 4, 9, 10, 21, 22, 25, 28, 33, 34, 39, 40, 49, 52, 55, 58, 69, 70, 81, 82, 85, 88, 91, 100, 111, 112, 115, 118, 121, 130, 133, 136, 141, 142, 165, 166, 171, 176, 177, 182, 185, 188, 195, 202, 207, 212, 219, 220, 237, 242, 245, 246, 253, 256, 265, 276, 287, 290]

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

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