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.

A341982 Number of ways to write n as an ordered sum of 2 primes (counting 1 as a prime).

Table of values

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

List of values

[1, 2, 3, 2, 3, 2, 4, 2, 3, 0, 4, 2, 5, 2, 4, 0, 6, 2, 6, 2, 5, 0, 8, 2, 5, 0, 4, 0, 8, 2, 6, 2, 7, 0, 8, 0, 5, 2, 6, 0, 10, 2, 8, 2, 7, 0, 12, 2, 8, 0, 6, 0, 12, 2, 6, 0, 7, 0, 14, 2, 7, 2, 10, 0, 12, 0, 6, 2, 10, 0, 14, 2, 11, 2, 10, 0, 14, 0, 10, 2, 9, 0, 18, 2, 9, 0, 8]

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

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