A088951 Number of distinct square-subwords in ternary representation of n.

0, 0, 0, 0, 1, 0, 0, 0, 1, 1, 0, 0, 1, 1, 1, 0, 0, 1, 1, 0, 0, 0, 1, 0, 1, 1, 1, 1, 1, 1, 1, 1, 0, 0, 0, 1, 2, 1, 1, 1, 2, 1, 1, 1, 2, 1, 0, 0, 0, 1, 1, 1, 1, 1, 1, 1, 1, 0, 1, 0, 1, 0, 1, 1, 0, 0, 1, 1, 1, 0, 1, 1, 2, 1, 1, 1, 2, 1, 1, 1, 2, 2, 1, 1, 1, 2, 1, 1, 1, 2, 2, 2, 1, 1, 1, 1, 0, 0, 1, 1, 0, 1

Offset

0,37

Comments

a(n) <= A088950(n).

Links

Table of n, a(n) for n=0..101.

Eric Weisstein's World of Mathematics, Squarefree Word

Example

n=125: a(125)=2 because 125 -> '11122' has 3 square-subwords: 11, 11 and 22 (11---, -11-- and ---22) and two of them are distinct.

Crossrefs

Cf. A007089.

Sequence in context: A146289 A214575 A081418 * A361633 A186006 A236398

Adjacent sequences: A088948 A088949 A088950 * A088952 A088953 A088954

Keyword

nonn

Author

Reinhard Zumkeller, Oct 25 2003

Status

approved