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.

A051935 a(n) = smallest number > a(n-1) such that a(1) + a(2) + ... + a(n) is a prime.

Table of values

n a(n)
1 2
2 3
3 6
4 8
5 10
6 12
7 18
8 20
9 22
10 26
11 30
12 34
13 36
14 42
15 44
16 46
17 50
18 52
19 60
20 66
21 72
22 74
23 76
24 78
25 80
26 82
27 102
28 108
29 114
30 116
31 118
32 126
33 128
34 132
35 136
36 138
37 144
38 146
39 150
40 154
41 158
42 162
43 166
44 170
45 174
46 186
47 196
48 198
49 210
50 222
51 228
52 236
53 240
54 244
55 246
56 254
57 270
58 280
59 282

List of values

[2, 3, 6, 8, 10, 12, 18, 20, 22, 26, 30, 34, 36, 42, 44, 46, 50, 52, 60, 66, 72, 74, 76, 78, 80, 82, 102, 108, 114, 116, 118, 126, 128, 132, 136, 138, 144, 146, 150, 154, 158, 162, 166, 170, 174, 186, 196, 198, 210, 222, 228, 236, 240, 244, 246, 254, 270, 280, 282]

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

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