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.

A112801 Number of ways of representing 2n-1 as sum of three integers, each with two distinct prime factors.

Table of values

n a(n)
1 0
2 0
3 0
4 0
5 0
6 0
7 0
8 0
9 0
10 0
11 0
12 0
13 0
14 1
15 0
16 1
17 2
18 2
19 2
20 4
21 4
22 4
23 8
24 7
25 8
26 11
27 11
28 13
29 15
30 16
31 18
32 23
33 23
34 26
35 30
36 31
37 33
38 40
39 40
40 45
41 51
42 53
43 56
44 62
45 66
46 66
47 76
48 79
49 82
50 88
51 94
52 96
53 105
54 111
55 111
56 124
57 127
58 132
59 141
60 145
61 148
62 164
63 166
64 170
65 180
66 187
67 187
68 206
69 204
70 208

List of values

[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 0, 1, 2, 2, 2, 4, 4, 4, 8, 7, 8, 11, 11, 13, 15, 16, 18, 23, 23, 26, 30, 31, 33, 40, 40, 45, 51, 53, 56, 62, 66, 66, 76, 79, 82, 88, 94, 96, 105, 111, 111, 124, 127, 132, 141, 145, 148, 164, 166, 170, 180, 187, 187, 206, 204, 208]

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

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