id:A094006 - OEIS Search Results

Search: id:A094006

Displaying 1-1 of 1 results found.

page 1

a(1) = a(2) = 1; for n>1, a(n+1) = largest integer k such that the word a(1)a(2)...a(n-1) is of the form xy^k for words x and y (where y has positive length), i.e. the maximal number of repeating blocks at the end of the sequence so far.

+0
1

1, 1, 1, 2, 3, 1, 1, 1, 2, 3, 1, 2, 2, 1, 2, 1, 1, 2, 2, 1, 2, 1, 1, 2, 2, 2, 2, 3, 4, 1, 1, 1, 2, 3, 1, 1, 1, 2, 3, 1, 2, 2, 1, 2, 1, 1, 2, 2, 1, 2, 1, 1, 2, 2, 2, 2, 3, 4, 1, 2, 2, 1, 2, 1, 1, 2, 2, 1, 2, 1, 1, 2, 2, 2, 2, 3, 4, 1, 2, 2, 2, 2, 3, 4, 1, 2, 2, 2, 2, 3, 4, 2, 3, 1, 1, 1, 2, 3, 1, 1, 1 (list; graph; listen)

page 1

Search completed in 0.002 seconds

Last modified December 20 00:58 EST 2009. Contains 171054 sequences.

AT&T Labs Research