login
A395636
a(n) = number of triples (x, y, z) such that 2*x^2 + y*z = n, where x, y, z are distinct primes satisfying y < z.
1
1, 0, 0, 0, 0, 1, 1, 0, 0, 1, 0, 0, 0, 0, 0, 0, 0, 1, 1, 0, 1, 1, 0, 0, 1, 0, 0, 0, 0, 1, 1, 0, 0, 2, 0, 0, 1, 0, 0, 0, 1, 2, 1, 0, 0, 0, 0, 0, 1, 1, 2, 0, 0, 2, 1, 0, 0, 1, 0, 0, 2, 1, 1, 0, 0, 1, 1, 0, 0, 1, 1, 0, 2, 1, 0, 0, 1, 1, 2, 0, 2, 2, 0, 0, 1, 2
OFFSET
23,34
EXAMPLE
a(23) = 1 counts this triple: (2,3,5).
a(56) = 2 counts these triples: (3,2,19), (5,2,3).
MATHEMATICA
t[n_, c_] := Module[{r}, r = Flatten[Table[If[n - 2 x^2 <= 0, {},
Map[({x, #, Quotient[n - 2 x^2, #]} &),
Select[Divisors[n - 2 x^2], Divisible[n - 2 x^2, #] &]]],
{x, 1, Floor[Sqrt[n - 1]]}], 1]; Select[r, Apply[c, #] &]];
c = (PrimeQ[#1] && PrimeQ[#2] && PrimeQ[#3] && #2 < #3 &&
DuplicateFreeQ[{#1, #2, #3}] &);
Table[Length[t[n, c]], {n, 23, 130}]
(* Peter J. C. Moses, Mar 29 2026 *)
CROSSREFS
KEYWORD
nonn
AUTHOR
Clark Kimberling, May 09 2026
STATUS
approved