login
A091064
In binary representation: length of longest proper prefix of n, that is also a suffix.
4
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.
CROSSREFS
Sequence in context: A021501 A237049 A101662 * A373005 A275760 A293388
KEYWORD
nonn,base
AUTHOR
Reinhard Zumkeller, Dec 17 2003
STATUS
approved