id:A115509 - OEIS Search Results

Search: id:A115509

Displaying 1-1 of 1 results found.

page 1

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.

+0
3

1, 1, 2, 0, 0, 2, 4, 0, 0, 0, 0, 432, 1968, 24960, 161280, 0, 0, 0, 0, 0, 0 (list; graph; listen)

	OFFSET	`1,3`
	COMMENT	`Conjecture: if 2^(k+1)<=n<3*2^k for k>=1, then a(n)=0.`
	CROSSREFS	`Cf. A115507, A115508.` `Sequence in context: A111006 A046742 A024870 this_sequence A134312 A020474 A135589` `Adjacent sequences: A115506 A115507 A115508 this_sequence A115510 A115511 A115512`
	KEYWORD	`nonn`
	AUTHOR	`Max Alekseyev (maxal(AT)cs.ucsd.edu), Jan 31 2006`

page 1

Search completed in 0.002 seconds

Last modified July 26 13:41 EDT 2008. Contains 142293 sequences.

AT&T Labs Research