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.

A369241 Number of representations of 2^n - 1 as a sum (p*q + p*r + q*r) with three odd primes p <= q <= r.

Table of values

n a(n)
0 0
1 0
2 0
3 0
4 0
5 0
6 0
7 0
8 2
9 1
10 1
11 0
12 2
13 1
14 3
15 0
16 2
17 2
18 6
19 0
20 13
21 1
22 13
23 0
24 15
25 0
26 24
27 1
28 49
29 4
30 47
31 0
32 156
33 6
34 129
35 0
36 441
37 1
38 616

List of values

[0, 0, 0, 0, 0, 0, 0, 0, 2, 1, 1, 0, 2, 1, 3, 0, 2, 2, 6, 0, 13, 1, 13, 0, 15, 0, 24, 1, 49, 4, 47, 0, 156, 6, 129, 0, 441, 1, 616]