# Greetings from The On-Line Encyclopedia of Integer Sequences! http://oeis.org/ Search: id:a331908 Showing 1-1 of 1 %I A331908 #24 May 10 2020 14:55:18 %S A331908 168,3588,20424,73860,189468,402216,782808,1385040,2214108,3423840, %T A331908 5196312,7218552,10353432,13823772,18047124,24083736,31051152, %U A331908 38334972,48877440,59201544,72052956,88004184,106601088,124009020 %N 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. %C A331908 The terms are from numeric computation - no formula for a(n) is currently known. %H A331908 Scott R. Shannon, Hexagram regions for n = 1. %H A331908 Scott R. Shannon, Hexagram regions for n = 2. %H A331908 Scott R. Shannon, Hexagram regions for n = 3. %H A331908 Scott R. Shannon, Hexagram regions for n = 4. %H A331908 Scott R. Shannon, Hexagram regions for n = 5. %H A331908 Scott R. Shannon, Hexagram regions with random distance-based coloring for n = 1. %H A331908 Scott R. Shannon, Hexagram regions with random distance-based coloring for n = 2. %H A331908 Scott R. Shannon, Hexagram regions with random distance-based coloring for n = 3. %H A331908 Eric Weisstein's World of Mathematics, Hexagram. %Y A331908 Cf. A331909 (n-gons), A333116 (vertices), A333049 (edges), A007678, A092867, A331452, A331906. %K A331908 nonn,more %O A331908 1,1 %A A331908 _Scott R. Shannon_ and _N. J. A. Sloane_, Jan 31 2020 %E A331908 a(6)-a(24) from _Lars Blomberg_, May 10 2020 # Content is available under The OEIS End-User License Agreement: http://oeis.org/LICENSE