The OEIS is supported by the many generous donors to the OEIS Foundation.

 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 A258003 Capped binary boundary codes for holeless strictly non-overlapping polyhexes, only the maximal representative from each equivalence class obtained by rotating. 7
 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 (list; graph; refs; listen; history; text; internal format)
 OFFSET 0,2 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 PROG (Scheme, with Antti Karttunen's IntSeq-library) (define A258003 (MATCHING-POS 0 1 (lambda (n) (and (negative? (A037861 n)) (= (A256999 n) n) (isA255571? n) (isA255571? (A080542 n)))))) ;; Code for isA255571? given in A255571. 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). Sequence in context: A204216 A075937 A075938 * A258013 A258005 A258015 Adjacent sequences: A258000 A258001 A258002 * A258004 A258005 A258006 KEYWORD nonn,base AUTHOR Antti Karttunen, May 16 2015 STATUS approved

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recents
The OEIS Community | Maintained by The OEIS Foundation Inc.

Last modified July 13 15:36 EDT 2024. Contains 374284 sequences. (Running on oeis4.)