%I #12 Jul 06 2015 23:41:03
%S 1,127,2014,7918,31606,32122,32188,126394,486838,503482,505564,506332,
%T 511708,511804,513514,514936,2012890,2021098,2025196,2054044,2055544,
%U 7788250,8050522,8051434,8051548,8054620,8075098,8075110,8084380,8104888,8182636,8183020,8185756,8207218,8207602,8214442,8219596,8219602,8231884,8236516
%N Capped binary boundary codes for holeless strictly non-overlapping polyhexes with bilateral symmetry, only the maximal representative from each equivalence class obtained by rotating.
%C Indexing starts from zero, because a(0) = 1 is a special case, indicating an empty path in the honeycomb lattice.
%C These are capped binary boundary codes for those holeless polyhexes that stay same when they are flipped over and rotated appropriately.
%C A258205(n) gives the count of terms with binary width 2n + 1.
%H Antti Karttunen, <a href="/A258005/b258005.txt">Table of n, a(n) for n = 0..112</a>
%o (Scheme, with _Antti Karttunen_'s IntSeq-library)
%o (define A258005 (MATCHING-POS 0 1 (lambda (n) (and (negative? (A037861 n)) (= n (A256999 (A059893 n))) (isA255571? n) (isA255571? (A080542 n))))))
%Y Cf. A255571, A258205.
%Y Intersection of A258003 and A258209. Differs from A258003 for the first time at n=8, where a(8) = 486838 while A258003(8) = 127930.
%Y Subsequence of A258015 from which this differs for the first time at n=113.
%K nonn,base
%O 0,2
%A _Antti Karttunen_, May 31 2015