The On-Line Encyclopedia of Integer Sequences (OEIS)

Revision History for A367117 (Bold, blue-underlined text is an addition; faded, red-underlined text is a ~~deletion~~.)
Showing entries 1-10 | older changes

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.
(history; published version)

#34 by Joerg Arndt at Mon Nov 13 07:29:19 EST 2023

STATUS

reviewed

approved

#33 by Amiram Eldar at Mon Nov 13 04:49:19 EST 2023

STATUS

proposed

reviewed

#32 by Michel Marcus at Mon Nov 13 04:20:25 EST 2023

STATUS

editing

proposed

#31 by Michel Marcus at Mon Nov 13 04:20:22 EST 2023

COMMENTS

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

STATUS

approved

editing

#30 by N. J. A. Sloane at Sat Nov 11 00:22:12 EST 2023

STATUS

editing

approved

#29 by N. J. A. Sloane at Thu Nov 09 14:39:24 EST 2023

AUTHOR

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

STATUS

approved

editing

#28 by OEIS Server at Thu Nov 09 08:53:50 EST 2023

LINKS

Paolo Xausa, <a href="/A367117/b367117_1.txt">Table of n, a(n) for n = 0..10000</a>

#27 by Michael De Vlieger at Thu Nov 09 08:53:50 EST 2023

STATUS

reviewed

approved

Discussion

Thu Nov 09

08:53

OEIS Server: Installed first b-file as b367117.txt.

#26 by Michael De Vlieger at Thu Nov 09 08:53:48 EST 2023

STATUS

proposed

reviewed

#25 by Paolo Xausa at Thu Nov 09 03:38:13 EST 2023

STATUS

editing

proposed