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.

A068638 a(1) = 1, a(n) = smallest distinct composite number such that a(n) + a(k) is a composite number for all k = 1 to n.

Table of values

n a(n)
1 1
2 8
3 14
4 20
5 24
6 25
7 26
8 32
9 38
10 44
11 50
12 56
13 62
14 68
15 74
16 80
17 86
18 90
19 92
20 94
21 98
22 104
23 110
24 116
25 118
26 120
27 122
28 128
29 134
30 140
31 144
32 146
33 152
34 158
35 160
36 164
37 170
38 176
39 182
40 184
41 188
42 194
43 200
44 206
45 212
46 218
47 220
48 224
49 230
50 234
51 236
52 242
53 248
54 254
55 260
56 264
57 266

List of values

[1, 8, 14, 20, 24, 25, 26, 32, 38, 44, 50, 56, 62, 68, 74, 80, 86, 90, 92, 94, 98, 104, 110, 116, 118, 120, 122, 128, 134, 140, 144, 146, 152, 158, 160, 164, 170, 176, 182, 184, 188, 194, 200, 206, 212, 218, 220, 224, 230, 234, 236, 242, 248, 254, 260, 264, 266]

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

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