Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A046211
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A046211 Number of ternary Lyndon words whose digits sum to 1 mod 3; number of ternary Lyndon words whose digits sum to 2 mod 3; number of trace 1 (or 2) monic irreducible polynomials over GF(3). +0
13
1, 1, 3, 6, 16, 39, 104, 270, 729, 1960, 5368, 14742, 40880, 113828, 318864, 896670, 2532160, 7174089, 20390552, 58112088, 166037352, 475467916, 1364393896, 3922625070, 11297181456, 32588003000, 94143178827, 272342710380 (list; graph; listen)
OFFSET

1,3

COMMENT

Also number of ternary Lyndon words of trace 1 over GF(3). Also number of ternary Lyndon words of trace 2 over GF(3).

LINKS

Index entries for sequences related to Lyndon words

F. Ruskey, Number of q-ary Lyndon words with given trace mod q

F. Ruskey, Number of monic irreducible polynomials over GF(q) with zero trace ...

F. Ruskey, Number of Lyndon words of given trace

FORMULA

( Sum_{d|n, gcd(d, 3)=1} mu(d)*3^{n/d}) / (3n)

EXAMPLE

a(4)= 6 = |{ 0001, 0022, 0112, 0121, 0211, 1222 }|

CROSSREFS

Cf. A046209.

Sequence in context: A073079 A143560 A001675 this_sequence A018022 A166536 A128720

Adjacent sequences: A046208 A046209 A046210 this_sequence A046212 A046213 A046214

KEYWORD

nonn

AUTHOR

Frank Ruskey (fruskey(AT)cs.uvic.ca), Dec 13 1999

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 10 12:37 EST 2009. Contains 170569 sequences.


AT&T Labs Research