Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A032087
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A032087 Number of reversible strings with n beads of 4 colors. If more than 1 bead, not palindromic. +0
2
4, 6, 24, 120, 480, 2016, 8064, 32640, 130560, 523776, 2095104, 8386560, 33546240, 134209536, 536838144, 2147450880, 8589803520, 34359607296, 137438429184, 549755289600, 2199021158400, 8796090925056 (list; graph; listen)
OFFSET

1,1

LINKS

C. G. Bower, Transforms (2)

Elizabeth Wilmer, Notes on Stephan's conjectures 72, 73, and 74

FORMULA

"BHK" (reversible, identity, unlabeled) transform of 4, 0, 0, 0...

a(2n+1) = 2^(4n+1) - 2^(2n+1), a(2n) = 2^(4n-1) - 2^(2n) + 2^(2n-1), a(1)=4.

CROSSREFS

Cf. A088037.

Sequence in context: A067001 A057343 A000287 this_sequence A136591 A009459 A123055

Adjacent sequences: A032084 A032085 A032086 this_sequence A032088 A032089 A032090

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 July 26 13:41 EDT 2008. Contains 142293 sequences.


AT&T Labs Research