[go: up one dir, main page]

login

Year-end appeal: Please make a donation to the OEIS Foundation to support ongoing development and maintenance of the OEIS. We are now in our 61st year, we have over 378,000 sequences, and we’ve reached 11,000 citations (which often say “discovered thanks to the OEIS”).

A006156 revision #35

A006156
Number of ternary squarefree words of length n.
(Formerly M2550)
18
1, 3, 6, 12, 18, 30, 42, 60, 78, 108, 144, 204, 264, 342, 456, 618, 798, 1044, 1392, 1830, 2388, 3180, 4146, 5418, 7032, 9198, 11892, 15486, 20220, 26424, 34422, 44862, 58446, 76122, 99276, 129516, 168546, 219516, 285750, 372204, 484446, 630666, 821154, 1069512, 1392270, 1812876, 2359710, 3072486, 4000002, 5207706, 6778926, 8824956, 11488392, 14956584, 19470384, 25346550, 32996442, 42957300, 55921896, 72798942, 94766136, 123368406
OFFSET
0,2
REFERENCES
F.-J. Brandenburg, Uniformly growing k-th power-free homomorphisms, Theoretical Computer Sci., 23 (1983), 69-82.
J. Brinkhuis, Non-repetitive sequences on three symbols, Quart. J. Math. Oxford, 34 (1983), 145-149.
John Noonan and Doron Zeilberger, The Goulden-Jackson Cluster Method: Extensions, Applications and Implementations, 1997.
N. J. A. Sloane and Simon Plouffe, The Encyclopedia of Integer Sequences, Academic Press, 1995 (includes this sequence).
LINKS
Hans Havermann, Table of n, a(n) for n = 0..110 [Terms 1-90 come from the The Entropy of Square-Free Words by Baake, Elser, & Grimm (pages 10, 11). Terms 91-110 come from Grimm's Improved Bounds on the Number of Ternary Square-Free Words (page 3).]
M. Baake, V. Elser and U. Grimm, The entropy of square-free words
S. Ekhad and D. Zeilberger, There are more than 2^(n/17) n-letter ternary square-free words, J. Integer Sequences, Vol. 1 (1998), Article 98.1.9
U. Grimm, Improved bounds on the number of ternary square-free words, J. Integer Sequences, Vol. 4 (2001), Article 01.2.7
Yuriy Tarannikov, The minimal density of a letter in an infinite ternary square-free word is 0.2746..., Journal of Integer Sequences, Vol. 5 (2002), Article 02.2.2
Eric Weisstein's World of Mathematics, Squarefree Word
EXAMPLE
Let the alphabet be {a,b,c}. Then:
a(1)=3: a, b, c.
a(2)=6: all xy except aa, bb, cc.
a(3)=12: aba, abc, aca, acb and similar words beginning with b and c, for a total of 12.
MATHEMATICA
(* A simple solution (though not at all efficient beyond n = 12) : *) a[0] = 1; a[n_] := a[n] = Length @ DeleteCases[Tuples[Range[3], n] , {a___, b__, b__, c___} ]; s = {}; Do[Print["a[", n, "] = ", a[n]]; AppendTo[s, a[n]], {n, 0, 12}]; s (* From Jean-François Alcover, May 02 2011 *)
CROSSREFS
Cf. A060688.
Sequence in context: A116958 A242477 * A171370 A061776 A356020 A341316
KEYWORD
nonn,nice,changed
EXTENSIONS
Links corrected by Eric Rowland, Sep 16 2010
STATUS
editing