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.

A129904 Find the first two terms in A003215, say A003215(i) and A003215(j), that are divisible by a number in A016921 not 1, say by k = A016921(m). Then i + j + 1 = k and k is added to the sequence.

Table of values

n a(n)
1 7
2 13
3 19
4 31
5 37
6 43
7 49
8 61
9 67
10 73
11 79
12 91
13 97
14 103
15 109
16 127
17 133
18 139
19 151
20 157
21 163
22 169
23 181
24 193
25 199
26 211
27 217
28 223
29 229
30 241
31 247
32 259
33 271
34 277
35 283
36 301
37 307
38 313
39 331
40 337
41 343
42 349
43 361
44 367
45 373
46 379
47 397
48 403
49 409
50 421
51 427
52 433
53 439
54 457
55 463

List of values

[7, 13, 19, 31, 37, 43, 49, 61, 67, 73, 79, 91, 97, 103, 109, 127, 133, 139, 151, 157, 163, 169, 181, 193, 199, 211, 217, 223, 229, 241, 247, 259, 271, 277, 283, 301, 307, 313, 331, 337, 343, 349, 361, 367, 373, 379, 397, 403, 409, 421, 427, 433, 439, 457, 463]

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

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