login
A394786
a(n) = number of triples (x, y, z) such that x^2 + y*z = n, where x,y,z are positive integers satisfying x^2 < y*z.
3
0, 0, 0, 2, 2, 3, 2, 4, 2, 6, 7, 6, 6, 9, 6, 6, 10, 7, 6, 14, 9, 14, 12, 10, 12, 17, 9, 12, 14, 15, 10, 16, 10, 18, 21, 12, 20, 23, 12, 18, 23, 19, 14, 20, 20, 19, 24, 12, 18, 28, 13, 24, 29, 23, 20, 28, 22, 28, 27, 20, 24, 37, 14, 20, 36, 28, 20, 30, 19, 30
OFFSET
0,4
EXAMPLE
a(10) = 7 counts these triples: (1, 1, 9), (1, 3, 3), (1, 9, 1), (2, 1, 6), (2, 2, 3), (2, 3, 2), (2, 6, 1).
MATHEMATICA
t[n_, c_] := Module[{r}, r = Flatten[Table[If[n - x^2 <= 0, {},
Map[({x, #, Quotient[n - x^2, #]} &),
Select[Divisors[n - x^2], Divisible[n - x^2, #] &]]], {x, 1,
Floor[Sqrt[n - 1]]}], 1]; Select[r, Apply[c, #] &]];
c = ((#1)^2 < #2*#3 &);
Join[{0}, Table[Length[t[n, c]], {n, 1, 130}]]
(* Peter J. C. Moses, Mar 29 2026 *)
CROSSREFS
KEYWORD
nonn
AUTHOR
Clark Kimberling, Apr 18 2026
STATUS
approved