A103152 - cp's OEIS frontend

A103152 Smallest odd number which can be written as a sum 2p+q (where p and q are both odd primes, A065091) in exactly n ways, zero if there are no such odd number.

n	a(n)
1	9
2	13
3	17
4	29
5	45
6	51
7	69
8	81
9	99
10	93
11	105
12	135
13	153
14	201
15	195
16	165
17	231
18	237
19	321
20	297
21	225
22	363
23	725
24	393
25	285
26	315
27	471
28	483
29	435
30	405
31	465
32	561
33	555
34	495
35	609
36	783
37	675
38	867
39	849
40	963
41	645
42	525
43	693
44	897
45	795
46	915
47	987
48	735
49	855
50	825
51	765
52	1095
53	975
54	1467

[9, 13, 17, 29, 45, 51, 69, 81, 99, 93, 105, 135, 153, 201, 195, 165, 231, 237, 321, 297, 225, 363, 725, 393, 285, 315, 471, 483, 435, 405, 465, 561, 555, 495, 609, 783, 675, 867, 849, 963, 645, 525, 693, 897, 795, 915, 987, 735, 855, 825, 765, 1095, 975, 1467]

cp's OEIS Frontend

A103152 Smallest odd number which can be written as a sum 2p+q (where p and q are both odd primes, A065091) in exactly n ways, zero if there are no such odd number.

Table of values

List of values