|
|
A236442
|
|
Number of ordered ways to write n = k + m with k > 0 and m > 0 such that A000009(k) + A047967(m) is prime.
|
|
2
|
|
|
0, 0, 1, 3, 3, 4, 3, 4, 3, 5, 2, 3, 4, 3, 1, 4, 4, 1, 2, 4, 4, 2, 4, 4, 3, 5, 8, 5, 4, 5, 7, 4, 3, 5, 2, 7, 5, 3, 5, 4, 5, 9, 4, 5, 5, 5, 8, 6, 7, 7, 8, 9, 5, 9, 7, 8, 13, 5, 4, 8, 4, 8, 3, 9, 9, 6, 7, 8, 6, 9, 7, 7, 4, 10, 7, 6, 8, 8, 5, 9, 6, 10, 5, 10, 12, 6, 11, 5, 5, 9, 8, 8, 4, 4, 11, 8, 8, 12, 6, 8
(list;
graph;
refs;
listen;
history;
text;
internal format)
|
|
|
OFFSET
|
1,4
|
|
COMMENTS
|
Conjecture: (i) a(n) > 0 for all n > 2.
(ii) If n > 2 is neither 18 nor 30, then n can be written as k + m with k > 0 and m > 0 such that A000009(k)^2 + A047967(m)^2 is prime.
(iii) Any integer n > 4 can be written as k + m with k > 0 and m > 0 such that A000009(k)*A047967(m) - 1 (or A000009(k)*A047967(m) + 1) is prime.
|
|
LINKS
|
|
|
EXAMPLE
|
a(15) = 1 since 15 = 13 + 2 with A000009(13) + A047967(13) = 18 + 1 = 19 prime.
a(18) = 1 since 18 = 3 + 15 with A000009(3) + A047967(15) = 2 + 149 = 151 prime.
|
|
MATHEMATICA
|
p[n_, k_]:=PrimeQ[PartitionsQ[k]+(PartitionsP[n-k]-PartitionsQ[n-k])]
a[n_]:=Sum[If[p[n, k], 1, 0], {k, 1, n-1}]
Table[a[n], {n, 1, 100}]
|
|
CROSSREFS
|
|
|
KEYWORD
|
nonn
|
|
AUTHOR
|
|
|
STATUS
|
approved
|
|
|
|