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

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

Offset

0,8

Comments

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

Alois P. Heinz, Table of n, a(n) for n = 0..10000

Index entries for sequences related to binary expansion of n

Crossrefs

Cf. A007088, A242869.

Sequence in context: A021501 A237049 A101662 * A373005 A275760 A293388

Adjacent sequences: A091061 A091062 A091063 * A091065 A091066 A091067

Keyword

nonn,base

Author

Reinhard Zumkeller, Dec 17 2003

Status

approved