id:A088950 - OEIS Search Results

Search: id:A088950

Displaying 1-1 of 1 results found.

page 1

Number of square-subwords in ternary representation of n.

+0
3

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 (list; graph; listen)

	OFFSET	`0,14`
	COMMENT	`A square-(sub)word consists of two identical adjacent subwords.`
	LINKS	`Eric Weisstein's World of Mathematics, Squarefree Word`
	EXAMPLE	`n=90: a(90)=2 because 90 -> '10100' has 2 square-subwords: 00 and` `1010.`
	CROSSREFS	`Cf. A007089, A088951.` `Sequence in context: A096608 A155102 A015964 this_sequence A083025 A046080 A035227` `Adjacent sequences: A088947 A088948 A088949 this_sequence A088951 A088952 A088953`
	KEYWORD	`nonn`
	AUTHOR	`Reinhard Zumkeller (reinhard.zumkeller(AT)gmail.com), Oct 25 2003`

page 1

Search completed in 0.002 seconds

Last modified November 25 20:09 EST 2009. Contains 167514 sequences.

AT&T Labs Research