A088950 Number of square-subwords in ternary representation of n.

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

Offset

0,14

Comments

A square-(sub)word consists of two nonempty identical adjacent subwords.

Links

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

Eric Weisstein's World of Mathematics, Squarefree Word

Example

n=90: a(90)=2 because 90 -> '10100' has 2 square-subwords: 00 and 1010.

Mathematica

Table[SequenceCount[IntegerDigits[n, 3], {x__, x__}, Overlaps -> All], {n, 0, 100}] (* Vladimir Reshetnikov, May 17 2016 *)

Crossrefs

Cf. A007089, A088951, A088952.

Sequence in context: A348446 A279278 A015964 * A267113 A083025 A046080

Adjacent sequences: A088947 A088948 A088949 * A088951 A088952 A088953

Keyword

nonn,base

Author

Reinhard Zumkeller, Oct 25 2003

Status

approved