login
A091269
a(n) = length of longest prefix of binary representation of n that is also a suffix of that of n+1.
2
0, 0, 1, 0, 1, 2, 2, 0, 1, 2, 1, 0, 1, 3, 3, 0, 1, 2, 1, 3, 3, 2, 1, 0, 1, 0, 2, 0, 1, 4, 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, 5, 5, 0, 1, 2, 1, 3, 1, 2, 1, 4, 4, 2, 1, 3, 1, 2, 1, 0, 1, 2, 1, 5, 5, 2, 1, 0, 1, 2, 4, 0, 3, 2, 1, 0, 1, 0, 2, 0, 1, 3
OFFSET
0,6
COMMENTS
a(A091270(n)) = n and a(m) < n for m < A091270(n).
CROSSREFS
Cf. A007088.
Sequence in context: A122190 A237291 A146093 * A287455 A216789 A097951
KEYWORD
nonn,base
AUTHOR
Reinhard Zumkeller, Dec 27 2003
STATUS
approved