|
%I #16 Apr 18 2023 12:07:00
%S 0,0,1,0,1,1,3,3,16,23,80,183,564
%N Number of one-sided fusenes (not necessarily planar) of perimeter 2n, counted up to rotations.
%C This sequence counts fusenes up to rotations, but with no turning over allowed. Fusenes are like polyhexes with additional criteria that no holes are allowed, while on the other hand, helicene-like self-touching or self-overlapping configurations are included in the count here. Cf. the links and further comments at A258019.
%C For n >= 1, a(n) gives the total number of terms k in A258013 with binary width = 2n + 1, or equally, with A000523(k) = 2n.
%H Xiaofeng Guo, Pierre Hansen, and Maolin Zheng, <a href="http://dx.doi.org/10.1016/S0166-218X(01)00180-9">Boundary uniqueness of fusenes</a>, Discrete Applied Mathematics 118 (2002), pp. 209-222.
%H Pornrat Ruengrot and Duangkamon Baowan, <a href="https://doi.org/10.1016/j.commatsci.2023.112181">Classification of k-defect holes on a graphene sheet</a>, Comp. Materials Sci. (2023) Vol. 225, 112181.
%H Eric Weisstein's World of Mathematics, <a href="http://mathworld.wolfram.com/Fusene.html">Fusene</a>
%H Wikipedia, <a href="http://en.wikipedia.org/wiki/Helicene">Helicene</a>
%F Other identities and observations. For all n >= 1:
%F a(n) = 2*A258019(n) - A258018(n).
%F a(n) >= A258204(n).
%Y Cf. A258018, A258019, A258204.
%Y Cf. A258013.
%K nonn,more
%O 1,7
%A _Antti Karttunen_, Jun 02 2015
|
