login
This site is supported by donations to The OEIS Foundation.
Logo

Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A053563 Number of ternary Lyndon words of length n with trace 1 and subtrace 1 over GF(3). Same as the number of ternary Lyndon words of length n with trace 2 and subtrace 1 over GF(3). 5
0, 0, 1, 1, 4, 13, 36, 90, 243, 661, 1804, 4914, 13608, 37944, 106288, 298755, 843796, 2391363, 6797196, 19370696, 55345784, 158491993, 454803100, 1307541690, 3765720066, 10862667648, 31381059609, 90780846494, 262951527460 (list; graph; refs; listen; history; internal format)
OFFSET

1,5

LINKS

F. Ruskey, Ternary Lyndon words of given trace and subtrace over GF(3)

FORMULA

(1/n) Sum mu(d) M(n/d, 0, 2); d|n, d=1(3) + (1/n) Sum mu(d) M(n/d, 0, 1); d|n, d=2(3) where M(n, t, s) = Sum n!/(i!j!k!); i+j+k=n, j=t(3), k=s(3).

EXAMPLE

a(4) = 1 = |{ 0022 }|

CROSSREFS

Cf. A053548, A053560, A053561, A053562, A053564.

Sequence in context: A002727 A036629 A079922 * A036636 A036643 A000299

Adjacent sequences:  A053560 A053561 A053562 * A053564 A053565 A053566

KEYWORD

nonn

AUTHOR

Frank Ruskey (ruskey(AT)cs.uvic.ca), Jan 17 2000

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Transforms | Puzzles | Hot | Classics
Recent Additions | More pages | Superseeker | Maintained by The OEIS Foundation Inc.

Content is available under The OEIS End-User License Agreement .

Last modified February 14 21:50 EST 2012. Contains 205663 sequences.