Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A056268
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A056268 Number of primitive (aperiodic) words of length n which contain exactly three different symbols. +0
2
0, 0, 6, 36, 150, 534, 1806, 5760, 18144, 55830, 17100, 6, 518580, 1569750, 4732014, 14250450, 42844320, 128746950, 38661, 5376, 1160688606, 3483582660, 10454059938, 31368305694, 941180, 13006, 282378679920 (list; graph; listen)
OFFSET

1,3

REFERENCES

M. R. Nester (1999). Mathematical investigations of some plant interaction designs. PhD Thesis. University of Queensland, Brisbane, Australia.

FORMULA

sum mu(d)*A001117(n/d) where d|n.

CROSSREFS

Cf. A000244, A001117, A054718.

Sequence in context: A061707 A056375 A018214 this_sequence A001117 A055404 A132165

Adjacent sequences: A056265 A056266 A056267 this_sequence A056269 A056270 A056271

KEYWORD

nonn

AUTHOR

Marks R. Nester (nesterm(AT)dpi.qld.gov.au)

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 November 25 08:46 EST 2009. Contains 167481 sequences.


AT&T Labs Research