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.

A112800 Number of ways of representing 2n-1 as sum of three integers with 1 distinct prime factor.

Table of values

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

List of values

[0, 0, 0, 1, 3, 4, 6, 8, 9, 10, 12, 14, 14, 16, 18, 18, 20, 23, 25, 26, 28, 30, 30, 32, 32, 34, 37, 36, 40, 43, 42, 44, 46, 46, 46, 50, 51, 53, 59, 57, 57, 61, 62, 62, 66, 68, 69, 71, 72, 71, 73, 76, 74, 81, 81, 78, 87, 90, 87, 91, 93, 90, 94, 97, 94, 100, 107, 103, 114, 115]