A331908 - OEIS

The OEIS is supported by the many generous donors to the OEIS Foundation.

A331908

The number of regions inside a hexagram formed by the straight line segments mutually connecting all vertices and all points that divide the sides into n equal parts.

5

168, 3588, 20424, 73860, 189468, 402216, 782808, 1385040, 2214108, 3423840, 5196312, 7218552, 10353432, 13823772, 18047124, 24083736, 31051152, 38334972, 48877440, 59201544, 72052956, 88004184, 106601088, 124009020

(list; graph; refs; listen; history; text; internal format)

OFFSET

1,1

COMMENTS

The terms are from numeric computation - no formula for a(n) is currently known.

LINKS

Table of n, a(n) for n=1..24.

Scott R. Shannon, Hexagram regions for n = 1.

Scott R. Shannon, Hexagram regions for n = 2.

Scott R. Shannon, Hexagram regions for n = 3.

Scott R. Shannon, Hexagram regions for n = 4.

Scott R. Shannon, Hexagram regions for n = 5.

Scott R. Shannon, Hexagram regions with random distance-based coloring for n = 1.

Scott R. Shannon, Hexagram regions with random distance-based coloring for n = 2.

Scott R. Shannon, Hexagram regions with random distance-based coloring for n = 3.

Eric Weisstein's World of Mathematics, Hexagram.

CROSSREFS

Cf. A331909 (n-gons), A333116 (vertices), A333049 (edges), A007678, A092867, A331452, A331906.

Sequence in context: A232274 A110075 A360623 * A231995 A223243 A282614

Adjacent sequences: A331905 A331906 A331907 * A331909 A331910 A331911

KEYWORD

nonn,more

AUTHOR

Scott R. Shannon and N. J. A. Sloane, Jan 31 2020

EXTENSIONS

a(6)-a(24) from Lars Blomberg, May 10 2020

STATUS

approved