# How many square occurrences must a binary sequence contain?

Kucherov, Gregory; Ochem, Pascal; Rao, Michaël

The Electronic Journal of Combinatorics [electronic only] (2003)

- Volume: 10, Issue: 1, page Research paper R12, 6 p.-Research paper R12, 6 p.
- ISSN: 1077-8926

## Access Full Article

top## How to cite

topKucherov, Gregory, Ochem, Pascal, and Rao, Michaël. "How many square occurrences must a binary sequence contain?." The Electronic Journal of Combinatorics [electronic only] 10.1 (2003): Research paper R12, 6 p.-Research paper R12, 6 p.. <http://eudml.org/doc/122596>.

@article{Kucherov2003,

author = {Kucherov, Gregory, Ochem, Pascal, Rao, Michaël},

journal = {The Electronic Journal of Combinatorics [electronic only]},

language = {eng},

number = {1},

pages = {Research paper R12, 6 p.-Research paper R12, 6 p.},

publisher = {Prof. André Kündgen, Deptartment of Mathematics, California State University San Marcos, San Marcos},

title = {How many square occurrences must a binary sequence contain?},

url = {http://eudml.org/doc/122596},

volume = {10},

year = {2003},

}

TY - JOUR

AU - Kucherov, Gregory

AU - Ochem, Pascal

AU - Rao, Michaël

TI - How many square occurrences must a binary sequence contain?

JO - The Electronic Journal of Combinatorics [electronic only]

PY - 2003

PB - Prof. André Kündgen, Deptartment of Mathematics, California State University San Marcos, San Marcos

VL - 10

IS - 1

SP - Research paper R12, 6 p.

EP - Research paper R12, 6 p.

LA - eng

UR - http://eudml.org/doc/122596

ER -

## NotesEmbed ?

topTo embed these notes on your page include the following JavaScript code on your page where you want the notes to appear.