cp's OEIS Frontend

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.

A255571 Numbers whose binary representation traces a nonselfcrossing circuit in honeycomb lattice when its bits (from the least to the second most significant bit) are interpreted as directions to proceed at each vertex. (The most significant 1-bit is ignored).

Original entry on oeis.org

1, 64, 65, 126, 127, 1056, 1057, 1090, 1091, 1156, 1157, 1288, 1289, 1518, 1519, 1552, 1553, 1782, 1783, 1914, 1915, 1980, 1981, 2014, 2015, 4368, 4369, 4642, 4643, 5188, 5189, 6006, 6007, 6280, 6281, 7098, 7099, 7644, 7645, 7918, 7919, 16962, 16963, 17028, 17029, 17160, 17161, 17542, 17543, 17544, 17545, 17674, 17675, 17938, 17939
Offset: 0

Views

Author

Antti Karttunen, Apr 13 2015

Keywords

Comments

Numbers n such that when we start scanning bits in the binary expansion of n, from the least to the most significant end, and when we interpret each bit as to a direction which to turn at each vertex (e.g., 0 = left, 1 = right) when traversing the edges of honeycomb lattice, then, when we have consumed all except the most significant 1-bit (which is ignored), we have eventually returned to the same vertex where we started from and none of the other vertices have been visited twice.
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.
If n is a member, then A054429(n) is also a member.

Examples

			The examples given in A255570 occur also in this sequence, except that 380 ("101111100" in binary) is excluded from this sequence, because it visits twice the first vertex after the starting vertex.
		

Crossrefs

Subsequence of A255570.