|
%I #24 May 10 2020 14:55:18
%S 168,3588,20424,73860,189468,402216,782808,1385040,2214108,3423840,
%T 5196312,7218552,10353432,13823772,18047124,24083736,31051152,
%U 38334972,48877440,59201544,72052956,88004184,106601088,124009020
%N 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.
%C The terms are from numeric computation - no formula for a(n) is currently known.
%H Scott R. Shannon, <a href="/A331908/a331908_5.png">Hexagram regions for n = 1</a>.
%H Scott R. Shannon, <a href="/A331908/a331908_1.png">Hexagram regions for n = 2</a>.
%H Scott R. Shannon, <a href="/A331908/a331908_2.png">Hexagram regions for n = 3</a>.
%H Scott R. Shannon, <a href="/A331908/a331908_3.png">Hexagram regions for n = 4</a>.
%H Scott R. Shannon, <a href="/A331908/a331908_4.png">Hexagram regions for n = 5</a>.
%H Scott R. Shannon, <a href="/A331908/a331908_6.png">Hexagram regions with random distance-based coloring for n = 1</a>.
%H Scott R. Shannon, <a href="/A331908/a331908_7.png">Hexagram regions with random distance-based coloring for n = 2</a>.
%H Scott R. Shannon, <a href="/A331908/a331908_8.png">Hexagram regions with random distance-based coloring for n = 3</a>.
%H Eric Weisstein's World of Mathematics, <a href="http://mathworld.wolfram.com/Hexagram.html">Hexagram</a>.
%Y Cf. A331909 (n-gons), A333116 (vertices), A333049 (edges), A007678, A092867, A331452, A331906.
%K nonn,more
%O 1,1
%A _Scott R. Shannon_ and _N. J. A. Sloane_, Jan 31 2020
%E a(6)-a(24) from _Lars Blomberg_, May 10 2020
| 