login

Year-end appeal: Please make a donation to the OEIS Foundation to support ongoing development and maintenance of the OEIS. We are now in our 61st year, we have over 378,000 sequences, and we’ve reached 11,000 citations (which often say “discovered thanks to the OEIS”).

A056353
Number of bracelet structures using a maximum of three different colored beads.
11
1, 1, 2, 3, 6, 9, 22, 40, 100, 225, 582, 1464, 3960, 10585, 29252, 80819, 226530, 636321, 1800562, 5107480, 14548946, 41538916, 118929384, 341187048, 980842804, 2824561089, 8147557742, 23536592235, 68087343148, 197216119545, 571924754778, 1660419530056, 4825588205920
OFFSET
0,3
COMMENTS
Turning over will not create a new bracelet. Permuting the colors of the beads will not change the structure.
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
R. M. Thompson and R. T. Downs, Systematic generation of all nonequivalent closest packed stacking sequences of length N using group theory, Acta Cryst. B57 (2001), 766-771; B58 (2002), 153.
FORMULA
Use de Bruijn's generalization of Polya's enumeration theorem as discussed in reference.
a(n) = Sum_{k=1..3} A152176(n, k) for n > 0. - Andrew Howroyd, Oct 25 2019
CROSSREFS
KEYWORD
nonn
EXTENSIONS
a(0)=1 prepended and terms a(28) and beyond from Andrew Howroyd, Oct 25 2019
STATUS
approved