The Square Trees in the Tribonacci Sequence

Abstract: The Tribonacci sequence

m a t h b b T

is the fixed point of the substitution

s i g m a (a, b, c) = (a b, a c, a)

. In this note, we get the explicit expressions of all squares, and then establish the tree structure of the positions of repeated squares in

m a t h b b T

, called square trees. Using the square trees, we give a fast algorithm for counting the number of repeated squares in

m a t h b b T [1, n]

for all

n

, where

m a t h b b T [1, n]

is the prefix of

m a t h b b T

of length

n

. Moreover we get explicit expressions for some special

n

such as

n = t_{m}

(the Tribonacci number) etc.

This page was built for publication: The Square Trees in the Tribonacci Sequence