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.

A356457 a(n) is the least number that can be written in exactly n ways as p*q + q*r + p*r where (p,q,r) is an unordered triple of distinct primes.

Table of values

n a(n)
0 1
1 31
2 71
3 151
4 191
5 491
6 671
7 887
8 311
9 1151
10 1391
11 1751
12 1031
13 2711
14 2831
15 3911
16 1991
17 3191
18 5351
19 9551
20 7031
21 20951
22 8951
23 8711
24 10631
25 5591
26 15431
27 10391
28 15791
29 28031
30 20471
31 17111
32 48191
33 27191
34 31391
35 39191
36 52631
37 35591
38 42311
39 61871
40 50951
41 92231
42 70391
43 108071
44 99431
45 103991
46 96071

List of values

[1, 31, 71, 151, 191, 491, 671, 887, 311, 1151, 1391, 1751, 1031, 2711, 2831, 3911, 1991, 3191, 5351, 9551, 7031, 20951, 8951, 8711, 10631, 5591, 15431, 10391, 15791, 28031, 20471, 17111, 48191, 27191, 31391, 39191, 52631, 35591, 42311, 61871, 50951, 92231, 70391, 108071, 99431, 103991, 96071]