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.

A214154 Number of ways to represent 2n as the sum of two distinct k-almost primes: #{m A001222(m)=A001222(2n-m)}.

Table of values

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

List of values

[0, 0, 0, 1, 2, 1, 2, 3, 3, 4, 2, 5, 4, 4, 6, 5, 4, 8, 4, 8, 7, 6, 5, 12, 8, 7, 8, 8, 7, 15, 6, 13, 9, 7, 11, 18, 9, 11, 14, 14, 8, 18, 12, 12, 19, 11, 12, 21, 9, 18, 14, 16, 13, 21, 16, 19, 16, 17, 13, 34, 12, 15, 22, 20, 15, 23, 14, 17, 17, 22]