Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A032070
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A032070 Number of reversible strings with n labeled beads of 3 colors, no palindromes of more than 1 bead. +0
1
3, 6, 54, 864, 12960, 252720, 5307120, 130636800, 3527193600, 106697606400, 3521021011200, 127105948569600, 4957131994214400, 208390202679859200, 9377559120593664000, 450260112212951040000 (list; graph; listen)
OFFSET

1,1

LINKS

C. G. Bower, Transforms (2)

FORMULA

"BHJ" (reversible, identity, labeled) transform of 3, 0, 0, 0...

n! * A032086.

CROSSREFS

Sequence in context: A067608 A023177 A132474 this_sequence A066569 A051641 A003098

Adjacent sequences: A032067 A032068 A032069 this_sequence A032071 A032072 A032073

KEYWORD

nonn

AUTHOR

Christian G. Bower (bowerc(AT)usa.net)

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 November 25 20:09 EST 2009. Contains 167514 sequences.


AT&T Labs Research