A258003 Capped binary boundary codes for holeless strictly non-overlapping polyhexes, only the maximal representative from each equivalence class obtained by rotating.

1, 127, 2014, 7918, 31606, 32122, 32188, 126394, 127930, 128476, 486838, 503254, 503482, 505306, 505564, 506332, 511450, 511462, 511708, 511804, 513514, 513772, 513778, 514540, 514804, 514936, 2012890, 2012902, 2013916, 2021098, 2021212, 2022124, 2025196, 2039254, 2043610, 2043622, 2045674, 2045788, 2046700

Offset: 0

Author

Antti Karttunen, May 16 2015

Keywords

• nonn
• base

Comments

Indexing starts from zero, because a(0) = 1 is a special case, indicating an empty path, which thus ends at the same vertex as where it started from.

A258204(n) gives the count of terms with binary width 2n + 1.

Links

• Antti Karttunen, Table of n, a(n) for n = 0..874

Crossrefs

Intersection of A257250 and A258002.

Subsequence of A258013.

Subsequence: A258005.

Cf. A037861, A080541, A080542, A255571, A256999, A258204.

Cf. also A258004 (the same terms without the most significant bit, slightly more compact representation).