OFFSET
3,3
COMMENTS
These are a subset of the points counted in A146212.
Note that n divides a(n). For odd n, it appears that a(n)=n(2n^3-15n^2+34n-21)/24. [Corrected by N. J. A. Sloane, Jun 11 2025. See next line.]
Theorem: For odd n >= 3, a(n) = n*(n-1)*(n-3)*(2*n-7)/24. Proof. We now know that for n odd >= 3, A146212(n) = n*(n^3-7*n^2+15*n-1)/8. Subtracting n + binomial(n,4) (see A007569), we get the stated formula. - N. J. A. Sloane, Jun 11 2025
LINKS
Jon E. Schoenfield, Table of n, a(n) for n = 3..100
P. Ryckelynck and L. Smoch, Simuorb: a new method for generating and describing the intersection points of clique-arrangements, arXiv:2509.25234 [math.GM], 2025. See p. 2.
CROSSREFS
KEYWORD
nonn
AUTHOR
T. D. Noe, Oct 28 2008
EXTENSIONS
More terms from Jon E. Schoenfield, Nov 11 2008
Definition clarified by N. J. A. Sloane, Jun 11 2025
STATUS
approved
