id:A088951 - OEIS Search Results

Search: id:A088951

Displaying 1-1 of 1 results found.

page 1

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

+0
2

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

	OFFSET	`0,37`
	COMMENT	`a(n) <= A088950(n).`
	LINKS	`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 A079211 A081418 this_sequence A107453 A164115 A164117` `Adjacent sequences: A088948 A088949 A088950 this_sequence A088952 A088953 A088954`
	KEYWORD	`nonn`
	AUTHOR	`Reinhard Zumkeller (reinhard.zumkeller(AT)gmail.com), Oct 25 2003`

page 1

Search completed in 0.002 seconds

Last modified November 23 17:09 EST 2009. Contains 167438 sequences.

AT&T Labs Research