OFFSET
1,4
COMMENTS
Denote the cevians by a0, a1,...,an, b0, b1,...,bn, c0, c1,...,cn. For any given n, the indices (i,j,k) of (ai, bj, ck) meeting at a point are the integer solutions of:
n^3 - (i + j + k)*n^2 + (j*k + k*i + i*j)*n - 2*i*j*k = 0, with 0 < i, j, k < n
or, equivalently and shorter,
(n-i)*(n-j)*(n-k) - i*j*k = 0, with 0 < i, j, k < n.
From N. J. A. Sloane, Feb 14 2020: (Start)
Stated another way, a(n) = number of triples (i,j,k) in [1,n-1] X [1,n-1] X [1,n-1] such that (i/(n-i))*(j/(n-j))*(k/(n-k)) = 1.
This is the quantity N3 mentioned in A091908.
Indices of zeros are precisely all odd numbers except those listed in A332378.
(End)
LINKS
Antti Karttunen, Table of n, a(n) for n = 1..1045 (first 200 terms from Robert Israel)
Peter Kagey, An illustration of A331423(4) = 7.
Jim Propp and Adam Propp-Gubin, Counting Triangles in Triangles, arXiv:2409.17117 [math.CO], 2024. See p. 9.
MAPLE
Ceva:= proc(n) local a, i, j, k; a:=0;
for i from 1 to n-1 do
for j from 1 to n-1 do
for k from 1 to n-1 do
if i*j*k/((n-i)*(n-j)*(n-k)) = 1 then a:=a+1; fi;
od: od: od: a; end;
t1:=[seq(Ceva(n), n=1..80)]; # N. J. A. Sloane, Feb 14 2020
MATHEMATICA
CevIntersections[n_] := Length[Solve[(n - i)*(n - j)*(n - k) - i*j*k == 0 && 0 < i < n && 0 < j < n && 0 < k < n, {i, j, k}, Integers]];
Map[CevIntersections[#] &, Range[50]]
PROG
(PARI) A331423(n) = sum(i=1, n-1, sum(j=1, n-1, sum(k=1, n-1, (1==(i*j*k)/((n-i)*(n-j)*(n-k)))))); \\ (After the Maple program) - Antti Karttunen, Dec 12 2021
CROSSREFS
KEYWORD
nonn,look
AUTHOR
César Eliud Lozada, Jan 16 2020
STATUS
approved
