This is a front-end for the Online Encyclopedia of Integer Sequences, made by Christian Perfect. The idea is to provide OEIS entries in non-ancient HTML, and then to think about how they're presented visually. The source code is on GitHub.
%I A258003 #17 Jul 06 2015 23:40:38 %S A258003 1,127,2014,7918,31606,32122,32188,126394,127930,128476,486838,503254, %T A258003 503482,505306,505564,506332,511450,511462,511708,511804,513514, %U A258003 513772,513778,514540,514804,514936,2012890,2012902,2013916,2021098,2021212,2022124,2025196,2039254,2043610,2043622,2045674,2045788,2046700 %N A258003 Capped binary boundary codes for holeless strictly non-overlapping polyhexes, only the maximal representative from each equivalence class obtained by rotating. %C A258003 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. %C A258003 A258204(n) gives the count of terms with binary width 2n + 1. %H A258003 Antti Karttunen, <a href="/A258003/b258003.txt">Table of n, a(n) for n = 0..874</a> %o A258003 (Scheme, with _Antti Karttunen_'s IntSeq-library) %o A258003 (define A258003 (MATCHING-POS 0 1 (lambda (n) (and (negative? (A037861 n)) (= (A256999 n) n) (isA255571? n) (isA255571? (A080542 n)))))) %o A258003 ;; Code for isA255571? given in A255571. %Y A258003 Intersection of A257250 and A258002. %Y A258003 Subsequence of A258013. %Y A258003 Subsequence: A258005. %Y A258003 Cf. A037861, A080541, A080542, A255571, A256999, A258204. %Y A258003 Cf. also A258004 (the same terms without the most significant bit, slightly more compact representation). %K A258003 nonn,base %O A258003 0,2 %A A258003 _Antti Karttunen_, May 16 2015