Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A056292
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A056292 Number of n-bead necklace structures using a maximum of four different colored beads. +0
5
1, 2, 3, 7, 11, 39, 103, 367, 1235, 4439, 15935, 58509, 215251, 799697, 2983217, 11187567, 42109451, 159082753, 602809327, 2290684251, 8726308317, 33318661277, 127479700199, 488672302909, 1876500180291 (list; graph; listen)
OFFSET

1,2

COMMENT

Turning over the necklace is not allowed. Colors may be permuted without changing the necklace structure.

REFERENCES

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

LINKS

N. J. A. Sloane, Maple code for this and related sequences

FORMULA

Use de Bruijn's generalization of Polya's enumeration theorem as discussed in reference.

CROSSREFS

Cf. A000013, A001868.

Adjacent sequences: A056289 A056290 A056291 this_sequence A056293 A056294 A056295

Sequence in context: A034295 A056354 A072534 this_sequence A106125 A073609 A053781

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 October 13 20:18 EDT 2008. Contains 145016 sequences.


AT&T Labs Research