login
This site is supported by donations to The OEIS Foundation.

 

Logo


Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A242530 Number of cyclic arrangements of S={1,2,...,2n} such that the binary expansions of any two neighbors differ by one bit. 15
0, 0, 1, 0, 2, 8, 0, 0, 224, 754, 0, 26256, 0, 0, 22472304, 0, 90654576, 277251016, 0, 7852128780 (list; graph; refs; listen; history; text; internal format)
OFFSET

1,5

COMMENTS

Here, a(n)=NPC(2n;S;P) is the count of all neighbor-property cycles for a specific set S of 2n elements and a pair-property P. For more details, see the link and A242519.

In this case the property P is the Gray condition. The choice of the set S is important; when it is replaced by {0,1,2,...,2n-1}, the sequence changes completely and becomes A236602.

LINKS

Table of n, a(n) for n=1..20.

S. Sykora, On Neighbor-Property Cycles, Stan's Library, Volume V, 2014.

EXAMPLE

The two cycles for n=5 (cycle length 10) are:

C_1={1,3,7,5,4,6,2,10,8,9}, C_2={1,5,4,6,7,3,2,10,8,9}.

PROG

(C++) See the link.

CROSSREFS

Cf. A236602, A242519, A242520, A242521, A242522, A242523, A242524, A242525, A242526, A242527, A242528, A242529, A242531, A242532, A242533, A242534.

Sequence in context: A095217 A230915 A242922 * A073410 A021361 A199156

Adjacent sequences:  A242527 A242528 A242529 * A242531 A242532 A242533

KEYWORD

nonn,hard,more,changed

AUTHOR

Stanislav Sykora, May 30 2014

EXTENSIONS

a(16)-a(20) from Fausto A. C. Cariboni, May 10 2017, May 15 2017

STATUS

approved

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

License Agreements, Terms of Use, Privacy Policy .

Last modified May 22 16:19 EDT 2017. Contains 286882 sequences.