Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A118311
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A118311 Number of dissimilar square-free quaternary words of length n. +0
1
1, 1, 2, 4, 11, 29, 77, 202, 532, 1395, 3664, 9605, 25192, 66047, 173183, 453998, 1190259, 3120294, 8180124, 21444290, 56217025, 147373441, 386342414, 1012799936, 2655067412 (list; graph; listen)
OFFSET

1,3

COMMENT

Sherman Stein and A006156 count ordered square-free(twin-free) ternary words. A060688 counts the dissimilar cases essentially by dividing by 3! (the number of ways to permute a,b,c). A051041 counts ordered square-free quaternary words. A118311 counts the dissimilar cases (beginning with the 4th term) by dividing A051041 by 4!

REFERENCES

Sherman Stein, How The Other Half Thinks, 2001, page 149

EXAMPLE

a(1) = 1 because a,b,c and d are similar.

a(2) = 1 because aa is not square-free; so ab is the only valid case.

a(3) = 2 counting aba and abc

a(4) = 4 counting abac, abca, abcb and abcd

a(5) = 11 counting abaca,abacb,abcab,abcac,abcba,abacd,abcad,abcbd,abcda,abcdb and abcdc

CROSSREFS

Cf. A006156, A060688, A051041.

Sequence in context: A148139 A061860 A093960 this_sequence A132836 A148140 A148141

Adjacent sequences: A118308 A118309 A118310 this_sequence A118312 A118313 A118314

KEYWORD

nonn

AUTHOR

Alford Arnold (Alford1940(AT)aol.com), Apr 22 2006

EXTENSIONS

a(16)-a(25) from Max Alekseyev (maxale(AT)gmail.com), Jul 03 2006

page 1

Search completed in 0.002 seconds

Lookup | Welcome | Find friends | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Transforms | Puzzles | Hot | Classics
More pages | Superseeker | Maintained by N. J. A. Sloane (njas@research.att.com)

Last modified December 15 00:47 EST 2009. Contains 170825 sequences.


AT&T Labs Research