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

Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A115509 Number of circular permutations where for every pair of adjacent elements one element in binary notation has ones at the same or adjacent positions to those of the other element. 2
1, 1, 2, 0, 0, 2, 4, 0, 0, 0, 0, 432, 1968, 24960, 161280, 0, 0, 0, 0, 0, 0 (list; graph; refs; listen; history; internal format)
OFFSET

1,3

COMMENTS

Conjecture: if 2^(k+1)<=n<3*2^k for k>=1, then a(n)=0.

CROSSREFS

Cf. A115507, A115508.

Sequence in context: A024870 A147699 A151669 * A134312 A195581 A020474

Adjacent sequences:  A115506 A115507 A115508 * A115510 A115511 A115512

KEYWORD

nonn,more

AUTHOR

Max Alekseyev (maxale(AT)gmail.com), Jan 31 2006

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

Content is available under The OEIS End-User License Agreement .

Last modified February 15 23:53 EST 2012. Contains 205860 sequences.