Total number of vertices 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, counting coinciding intersection points only once.

A331782

Total number of vertices 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, counting coinciding intersection points only once.

Terms

    a(0) =3a(1) =7a(2) =21a(3) =25a(4) =63a(5) =67a(6) =129a(7) =133a(8) =219a(9) =223a(10) =333a(11) =337a(12) =471a(13) =475a(14) =621a(15) =637a(16) =819a(17) =823a(18) =1029a(19) =1021a(20) =1263a(21) =1267a(22) =1521a(23) =1477a(24) =1803a(25) =1807a(26) =2109a(27) =2113a(28) =2439a(29) =2431

External references