id:A091064 - OEIS Search Results

Search: id:A091064

Displaying 1-1 of 1 results found.

page 1

In binary representation: length of longest proper prefix of n, that is also a suffix.

+0
3

0, 0, 0, 1, 0, 1, 0, 2, 0, 1, 2, 1, 0, 1, 0, 3, 0, 1, 2, 1, 0, 3, 2, 1, 0, 1, 0, 2, 0, 1, 0, 4, 0, 1, 2, 1, 3, 1, 2, 1, 0, 1, 4, 1, 0, 3, 2, 1, 0, 1, 0, 2, 0, 1, 3, 2, 0, 1, 0, 2, 0, 1, 0, 5, 0, 1, 2, 1, 3, 1, 2, 1, 0, 4, 2, 1, 3, 1, 2, 1, 0, 1, 2, 1, 0, 5, 2, 1, 0, 1, 2, 4, 0, 3, 2, 1, 0, 1, 0, 2, 0, 1 (list; graph; listen)

	OFFSET	`0,8`
	COMMENT	`a(n) <= A070939(n)-1 by definition;` `a(2^k-1)=k-1; for k>0: a(2^k+1)=1; for k>2: a(2^k+2)=2;` `a(A091065(n)) = 0, a(A091066(n)) > 0.`
	LINKS	`Index entries for sequences related to binary expansion of n`
	CROSSREFS	`Cf. A007088.` `Sequence in context: A136487 A021501 A101662 this_sequence A140224 A075993 A117170` `Adjacent sequences: A091061 A091062 A091063 this_sequence A091065 A091066 A091067`
	KEYWORD	`nonn,base`
	AUTHOR	`Reinhard Zumkeller (reinhard.zumkeller(AT)lhsystems.com), Dec 17 2003`

page 1

Search completed in 0.002 seconds

Last modified July 24 12:00 EDT 2008. Contains 142294 sequences.

AT&T Labs Research