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.

A362465 a(n) is the least number of 2 or more consecutive signed primes whose sum equals n.

Table of values

n a(n)
0 3
1 2
2 2
3 4
4 2
5 2
6 2
7 3
8 2
9 3
10 2
11 3
12 2
13 3
14 2
15 3
16 2
17 3
18 2
19 3
20 2
21 3
22 2
23 3
24 2
25 3
26 2
27 3
28 2
29 5
30 2
31 3
32 2
33 3
34 2
35 3
36 2
37 3
38 2
39 3
40 2
41 3
42 2
43 5
44 2
45 3
46 2
47 3
48 2
49 3
50 2
51 3
52 2
53 3
54 2
55 3
56 2
57 3
58 2
59 3
60 2
61 5
62 2
63 5
64 2
65 3
66 2
67 3
68 2
69 3
70 2
71 3
72 2
73 3
74 2
75 3
76 2
77 3
78 2
79 5
80 2
81 3
82 2
83 3
84 2
85 3
86 2
87 5
88 2
89 3

List of values

[3, 2, 2, 4, 2, 2, 2, 3, 2, 3, 2, 3, 2, 3, 2, 3, 2, 3, 2, 3, 2, 3, 2, 3, 2, 3, 2, 3, 2, 5, 2, 3, 2, 3, 2, 3, 2, 3, 2, 3, 2, 3, 2, 5, 2, 3, 2, 3, 2, 3, 2, 3, 2, 3, 2, 3, 2, 3, 2, 3, 2, 5, 2, 5, 2, 3, 2, 3, 2, 3, 2, 3, 2, 3, 2, 3, 2, 3, 2, 5, 2, 3, 2, 3, 2, 3, 2, 5, 2, 3]

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

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