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.

A354614 Number of distinct substrings of length A342263(n) that appear at least twice in the binary expansion of n.

Original entry on oeis.org

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, 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, 1, 3, 2, 2, 1, 1, 1, 2, 1, 2, 2, 1, 1, 3, 1, 2, 1, 1, 1
Offset: 0

Views

Author

Peter Kagey, Jul 08 2022

Keywords

Comments

Records occur at indices 0, 9, 69, 279, 8501, 17003, 49771, 136030, ...

Examples

			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.
  10000100110101
  .........101..
  ...........101
  100...........
  .....100......
  ....010.......
  ..........010.
  ...001........
  ......001.....
  .000..........
  ..000.........
		

Crossrefs

Cf. A342263.