Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A032095
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A032095 Number of reversible strings with n-1 black beads and n-1 white beads. String is not palindromic. +0
2
1, 1, 2, 10, 32, 126, 452, 1716, 6400, 24310, 92252, 352716, 1351616, 5200300, 20056584, 77558760, 300533760, 1166803110, 4537543340, 17672631900, 68923172032, 269128937220, 1052049129144, 4116715363800 (list; graph; listen)
OFFSET

1,3

LINKS

C. G. Bower, Transforms (2)

FORMULA

"BHK[ n ](2n-1)" (reversible, identity, unlabeled, n parts, 2n-1 elements) transform of 1, 1, 1, 1...

for n>1 a(n)=(1/2)*C(2n-2, n-1) if n is even, a(n)=(1/2)[C(2n-2, n-1)-C(n-1, (n-1)/2)] if n is odd. (Emeric Deutsch (deutsch(AT)duke.poly.edu) Jul 25 2002)

E.g.f. : 1+exp(x)*sinh(x)*BesselI(0,2x). [From Paul Barry (pbarry(AT)wit.ie), Aug 11 2009]

CROSSREFS

Central column of triangle A034877.

Sequence in context: A034555 A084154 A083099 this_sequence A151019 A004028 A080668

Adjacent sequences: A032092 A032093 A032094 this_sequence A032096 A032097 A032098

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