login
The OEIS is supported by the many generous donors to the OEIS Foundation.

 

Logo
Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A056268 Number of primitive (aperiodic) words of length n which contain exactly three different symbols. 1
0, 0, 6, 36, 150, 534, 1806, 5760, 18144, 55830, 171006, 518580, 1569750, 4732014, 14250450, 42844320, 128746950, 386615376, 1160688606, 3483582660, 10454059938, 31368305694, 94118013006, 282378679920, 847187946000, 2541662931990, 7625194813656, 22875982414740 (list; graph; refs; listen; history; text; internal format)
OFFSET
1,3
REFERENCES
M. R. Nester (1999). Mathematical investigations of some plant interaction designs. PhD Thesis. University of Queensland, Brisbane, Australia. [See A056391 for pdf file of Chap. 2]
LINKS
FORMULA
a(n) = Sum_{d|n} mu(d)*A001117(n/d).
PROG
(PARI) f(n) = 3^n - 3*2^n + 3;
a(n) = sumdiv(n, d, moebius(d)*f(n/d)); \\ Michel Marcus, Mar 25 2022
CROSSREFS
Sequence in context: A181478 A223841 A210322 * A001117 A353664 A353774
KEYWORD
nonn
AUTHOR
EXTENSIONS
a(11) and following corrected by Georg Fischer, Mar 24 2022
STATUS
approved

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recents
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy. .

Last modified July 27 14:37 EDT 2024. Contains 374647 sequences. (Running on oeis4.)