A091908 -id:A091908 - cp's OEIS frontend

A367117 Place n points in general position on each side of an equilateral triangle, and join every pair of the 3*n+3 boundary points by a chord; sequence gives number of vertices in the resulting planar graph.

3, 12, 72, 282, 795, 1818, 3612, 6492, 10827, 17040, 25608, 37062, 51987, 71022, 94860, 124248, 159987, 202932, 253992, 314130, 384363, 465762, 559452, 666612, 788475, 926328, 1081512, 1255422, 1449507, 1665270, 1904268, 2168112, 2458467, 2777052, 3125640, 3506058, 3920187, 4369962

Offset: 0

Scott R. Shannon and N. J. A. Sloane, Nov 05 2023

nonn

"In general position" implies that the internal lines (or chords) only have simple intersections. There is no interior point where three or more chords meet.

Note that although the number of k-gons in the graph will vary as the edge points change position, the total number of regions will stay constant as long as all internal vertices remain simple.

Paolo Xausa, Table of n, a(n) for n = 0..10000
Scott R. Shannon, Image for n = 1.
Scott R. Shannon, Image for n = 2.
Scott R. Shannon, Image for n = 5.

Cf. A367118 (regions), A367119 (edges).
See also A091908, A092098, A331782, A365929.
If the boundary points are equally spaced, we get A274585, A092866, A274586, A092867. - N. J. A. Sloane, Nov 09 2023

A367117[n_]:=3/4(n+1)(3n^3+n^2+4);Array[A367117,50,0] (* Paolo Xausa, Nov 09 2023 *)

Theorem: a(n) = (3/4)*(n+1)*(3*n^3+n^2+4).

a(n) = A367119(n) - A367118(n) + 1 by Euler's formula.

A367118 Place n points in general position on each side of an equilateral triangle, and join every pair of the 3*n+3 boundary points by a chord; sequence gives number of regions in the resulting planar graph.

Original entry on oeis.org

1, 13, 82, 307, 841, 1891, 3718, 6637, 11017, 17281, 25906, 37423, 52417, 71527, 95446, 124921, 160753, 203797, 254962, 315211, 385561, 467083, 560902, 668197, 790201, 928201, 1083538, 1257607, 1451857, 1667791, 1906966, 2170993, 2461537, 2780317, 3129106, 3509731, 3924073, 4374067

Offset: 0

Scott R. Shannon and N. J. A. Sloane, Nov 05 2023

nonn

"In general position" implies that the internal lines (or chords) only have simple intersections. There is no interior point where three or more chords meet.

Scott R. Shannon, Image for n = 1.
Scott R. Shannon, Image for n = 2.
Scott R. Shannon, Image for n = 5.

Cf. A367117 (vertices), A367119 (edges), A091908, A092098, A331782, A367015.

If the boundary points are equally spaced, we get A274585, A092866, A274586, A092867. - N. J. A. Sloane, Nov 09 2023

Conjecture: a(n) = (1/4)*(9*n^4 + 12*n^3 + 15*n^2 + 12*n + 4).

a(n) = A367119(n) - A367117(n) + 1 by Euler's formula.

A367119 Place n points in general position on each side of an equilateral triangle, and join every pair of the 3*n+3 boundary points by a chord; sequence gives number of edges in the resulting planar graph.

Original entry on oeis.org

3, 24, 153, 588, 1635, 3708, 7329, 13128, 21843, 34320, 51513, 74484, 104403, 142548, 190305, 249168, 320739, 406728, 508953, 629340, 769923, 932844, 1120353, 1334808, 1578675, 1854528, 2165049, 2513028, 2901363, 3333060, 3811233, 4339104, 4920003, 5557368, 6254745, 7015788

Offset: 0

Scott R. Shannon and N. J. A. Sloane, Nov 05 2023

nonn

"In general position" implies that the internal lines (or chords) only have simple intersections. There is no interior point where three or more chords meet.

See A367117 and A367118 for images of the triangle.

Cf. A367117 (vertices), A367118 (regions), A091908, A092098, A331782, A366932.

If the boundary points are equally spaced, we get A274585, A092866, A274586, A092867. - N. J. A. Sloane, Nov 09 2023

Conjecture: a(n) = (3/2)*(3*n^4 + 4*n^3 + 3*n^2 + 4*n + 2).

a(n) = A367117 (n) + A367118 (n) - 1 by Euler's formula.

A357007 Number of vertices in an equilateral triangle when n internal equilateral triangles are drawn between the 3n points that divide each side into n+1 equal parts.

Original entry on oeis.org

3, 6, 15, 30, 51, 66, 111, 150, 171, 246, 303, 312, 435, 510, 543, 678, 771, 765, 975, 1059, 1131, 1326, 1455, 1488, 1731, 1878, 1899, 2178, 2355, 2376, 2703, 2886, 2955, 3270, 3444, 3420, 3891, 4110, 4191, 4485, 4803, 4878, 5295, 5526, 5544, 6078, 6351, 6396, 6915, 7206, 7311, 7794, 8115

Offset: 0

Scott R. Shannon, Sep 08 2022

nonn

See A356984 for further images.

Scott R. Shannon, Table of n, a(n) for n = 0..250
Scott R. Shannon, Image for n = 1.
Scott R. Shannon, Image for n = 2.
Scott R. Shannon, Image for n = 3.
Scott R. Shannon, Image for n = 5. This is the first term that forms intersections with non-simple vertices.
Scott R. Shannon, Image for n = 10.
Scott R. Shannon, Image for n = 50.
Scott R. Shannon, Image for n = 100.
Scott R. Shannon, Image for n = 200.

Cf. A356984 (regions), A357008 (edges), A092866, A091908, A333026, A344657.

a(n) = A357008(n) - A356984(n) + 1 by Euler's formula.

Conjecture: a(n) = 3*n^2 + 3 for equilateral triangles that only contain simple vertices when cut by n internal equilateral triangles. This is never the case if (n + 1) mod 3 = 0 for n > 3.

A331423 Divide each side of a triangle into n>=1 equal parts and trace the corresponding cevians, i.e., join every point, except for the first and last ones, with the opposite vertex. a(n) is the number of points at which three cevians meet.

Original entry on oeis.org

0, 1, 0, 7, 0, 13, 0, 19, 0, 25, 0, 31, 0, 37, 6, 43, 0, 49, 0, 61, 0, 61, 0, 91, 0, 73, 0, 79, 0, 91, 0, 91, 0, 97, 12, 103, 0, 109, 0, 133, 0, 133, 0, 127, 42, 133, 0, 187, 0, 145, 0, 151, 0, 157, 12, 175, 0, 169, 0, 235, 0, 181, 48, 187, 6, 205, 0, 199, 0

Offset: 1

César Eliud Lozada, Jan 16 2020

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)

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.
Hugo Pfoertner, Visualization of diagonal intersections in an equilateral triangle.
Jim Propp and Adam Propp-Gubin, Counting Triangles in Triangles, arXiv:2409.17117 [math.CO], 2024. See p. 9.

Cf. A091908, A332378. Bisections are A331425, A331428.

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

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]]

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

A332377 One-third of total number of edges in graph formed by the straight line segments connecting the edges of an equilateral triangle with the n-1 points resulting from a subdivision of the sides into n equal pieces.

Original entry on oeis.org

1, 4, 13, 18, 41, 48, 85, 94, 145, 156, 221, 234, 313, 328, 415, 438, 545, 564, 685, 700, 841, 864, 1013, 1014, 1201, 1228, 1405, 1434, 1625, 1650, 1861, 1894, 2113, 2148, 2369, 2418, 2665, 2704, 2965, 2988, 3281, 3312, 3613, 3658, 3919, 4008, 4325

Offset: 1

N. J. A. Sloane, Feb 13 2020

nonn

N. J. A. Sloane, Table of n, a(n) for n = 1..1000

Cf. A091908, A092098 (number of cells), A331782 (number of vertices), A332376.

a(n) = (A092098(n) + A331782(n) - 1)/3 = A332376(n)/3.

cp's OEIS Frontend

A367117 Place n points in general position on each side of an equilateral triangle, and join every pair of the 3*n+3 boundary points by a chord; sequence gives number of vertices in the resulting planar graph.

Views

Author

Keywords

Comments

Links

Crossrefs

Programs

Mathematica

Formula

A367118 Place n points in general position on each side of an equilateral triangle, and join every pair of the 3*n+3 boundary points by a chord; sequence gives number of regions in the resulting planar graph.

Views

Author

Keywords

Comments

Links

Crossrefs

Formula

A367119 Place n points in general position on each side of an equilateral triangle, and join every pair of the 3*n+3 boundary points by a chord; sequence gives number of edges in the resulting planar graph.

Views

Author

Keywords

Comments

Crossrefs

Formula

A357007 Number of vertices in an equilateral triangle when n internal equilateral triangles are drawn between the 3n points that divide each side into n+1 equal parts.

Views

Author

Keywords

Comments

Links

Crossrefs

Formula

A331423 Divide each side of a triangle into n>=1 equal parts and trace the corresponding cevians, i.e., join every point, except for the first and last ones, with the opposite vertex. a(n) is the number of points at which three cevians meet.

Views

Author

Keywords

Comments

Links

Crossrefs

Programs

Maple

Mathematica

PARI

A332377 One-third of total number of edges in graph formed by the straight line segments connecting the edges of an equilateral triangle with the n-1 points resulting from a subdivision of the sides into n equal pieces.

Views

Author

Keywords

Links

Crossrefs

Formula