|
Search: id:A056323
|
|
|
| A056323 |
|
Number of reversible string structures with n beads using a maximum of four different colors. |
|
+0
4
|
|
| 1, 2, 4, 11, 31, 107, 379, 1451, 5611, 22187, 87979, 350891, 1400491, 5597867, 22379179, 89500331, 357952171, 1431743147, 5726775979, 22906841771, 91626580651, 366505274027, 1466017950379, 5864067607211
(list; graph; listen)
|
|
|
OFFSET
|
1,2
|
|
|
COMMENT
|
A string and its reverse are considered to be equivalent. Permuting the colors will not change the structure. Thus aabc, cbaa, and bbac are all considered to be identical.
|
|
REFERENCES
|
M. R. Nester (1999). Mathematical investigations of some plant interaction designs. PhD Thesis. University of Queensland, Brisbane, Australia.
|
|
FORMULA
|
Use de Bruijn's generalization of Polya's enumeration theorem as discussed in reference.
|
|
CROSSREFS
|
Cf. A032121.
Adjacent sequences: A056320 A056321 A056322 this_sequence A056324 A056325 A056326
Sequence in context: A004251 A110140 A115625 this_sequence A081557 A063254 A123443
|
|
KEYWORD
|
nonn
|
|
AUTHOR
|
Marks R. Nester (nesterm(AT)dpi.qld.gov.au)
|
|
|
Search completed in 0.002 seconds
|
