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.
%I A354614 #9 Jul 13 2022 14:50:33 %S A354614 1,1,1,1,1,1,1,1,1,2,1,1,2,1,1,1,1,1,1,2,1,1,1,1,1,2,1,1,1,1,1,1,1,1, %T A354614 2,1,1,2,1,1,2,2,1,1,1,1,2,1,1,1,1,1,1,1,1,1,2,1,2,1,1,1,1,1,1,1,1,1, %U A354614 1,3,2,2,1,1,1,2,1,2,2,1,1,3,1,2,1,1,1 %N A354614 Number of distinct substrings of length A342263(n) that appear at least twice in the binary expansion of n. %C A354614 Records occur at indices 0, 9, 69, 279, 8501, 17003, 49771, 136030, ... %e A354614 The binary expansion of 8501 is 10000100110101. And there are a(8501) = 5 longest repeated substrings: 101, 100, 010, 001, and 000, as illustrated below. %e A354614 10000100110101 %e A354614 .........101.. %e A354614 ...........101 %e A354614 100........... %e A354614 .....100...... %e A354614 ....010....... %e A354614 ..........010. %e A354614 ...001........ %e A354614 ......001..... %e A354614 .000.......... %e A354614 ..000......... %Y A354614 Cf. A342263. %K A354614 nonn,base %O A354614 0,10 %A A354614 _Peter Kagey_, Jul 08 2022