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.

A002100 a(n) = number of partitions of n into semiprimes (more precisely, number of ways of writing n as a sum of products of 2 distinct primes).

Table of values

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

List of values

[0, 0, 0, 0, 0, 1, 0, 0, 0, 1, 0, 1, 0, 1, 1, 1, 0, 1, 0, 2, 2, 2, 0, 2, 1, 3, 2, 3, 1, 4, 2, 4, 3, 5, 4, 7, 3, 6, 5, 8, 6, 10, 6, 10, 9, 12, 9, 15, 11, 16, 14, 18, 14, 22, 19, 25, 22, 27, 23, 33, 29, 36, 33, 40, 38, 49, 43, 53, 51, 61, 57, 71, 64, 77, 76, 89, 86, 102, 96, 113, 111, 128, 125]