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.

A385986 a(1) = 2, and for any n > 1, a(n) is the largest k < n such that a(1) + ... + a(k) is prime.

Table of values

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

List of values

[2, 1, 2, 3, 3, 5, 5, 5, 5, 9, 9, 9, 9, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 23, 23, 23, 23, 23, 23, 23, 23, 23, 23, 23, 23, 23, 23, 23, 23, 23, 23, 23, 23, 23, 23, 23, 23, 23, 23, 23, 23, 23, 23, 53, 53, 53, 53, 53, 53, 53, 53, 53, 53, 53, 53, 65, 65, 65]

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

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