Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A056311
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A056311 Number of reversible strings with n beads using exactly four different colors. +0
3
0, 0, 0, 12, 120, 780, 4212, 20424, 93360, 409380, 1749780, 7338792, 30394560, 124705140, 508291812, 2061607224, 8332140720, 33585777060, 135116412660, 542785800072, 2178110589600, 8733345234900 (list; graph; listen)
OFFSET

1,4

COMMENT

A string and its reverse are considered to be equivalent.

REFERENCES

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

FORMULA

Equals A032121(n)-4*A032120(n)+6*A005418(n+1)-4.

G.f.: 12*x^4*(3*x+1)*(8*x^4-3*x^3-2*x^2-x+1)/ ((x-1) * (4*x-1) * (3*x-1) * (2*x+1) * (2*x -1) * (3*x^2-1) * (2*x^2-1)) [From Maksym Voznyy (voznyy(AT)mail.ru), Jul 27 2009] [Corrected by R. J. Mathar, Sep 16 2009]

CROSSREFS

Cf. A032121.

Sequence in context: A001816 A133386 A056320 this_sequence A009050 A067358 A061506

Adjacent sequences: A056308 A056309 A056310 this_sequence A056312 A056313 A056314

KEYWORD

nonn

AUTHOR

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

EXTENSIONS

G.f. proposed by Maksym Voznyy checked and corrected by R. J. Mathar, Sep 16 2009.

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 December 17 23:40 EST 2009. Contains 171025 sequences.


AT&T Labs Research