cp's OEIS Frontend

This is a front-end for the Online Encyclopedia of Integer Sequences, made by Christian Perfect. The idea is to provide OEIS entries in non-ancient HTML, and then to think about how they're presented visually. The source code is on GitHub.

A097295 Length of longest non-overlapping repeated subword of n in binary representation.

This page as a plain text file.
%I A097295 #8 Mar 30 2012 18:50:44
%S A097295 0,0,1,1,1,1,1,1,1,2,1,1,1,1,2,1,1,2,1,2,2,2,1,1,1,2,2,1,1,2,2,1,1,2,
%T A097295 1,3,2,2,1,2,2,2,2,2,3,2,2,1,1,2,2,2,2,3,2,1,1,2,2,2,2,2,3,1,1,2,1,3,
%U A097295 2,2,1,3,3,2,2,3,2,2,2,2,2,2,2,2,3,2,2,2,2,3,3,2,3,2,2,1,1,2,2,3,2,3,2,2,2
%N A097295 Length of longest non-overlapping repeated subword of n in binary representation.
%C A097295 a(A007582(n))=n and a(m)<n for m < A007582(n).
%H A097295 <a href="/index/Bi#binary">Index entries for sequences related to binary expansion of n</a>
%Y A097295 Cf. A007088.
%K A097295 nonn
%O A097295 1,10
%A A097295 _Reinhard Zumkeller_, Aug 04 2004