Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A045693
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A045693 Number of binary words of length n (beginning 0) with autocorrelation function 2^(n-1)+3. +0
1
0, 0, 1, 0, 1, 3, 6, 11, 23, 44, 91, 179, 364, 723, 1457, 2902, 5827, 11633, 23310 (list; graph; listen)
OFFSET

1,6

FORMULA

a[ 2n-1 ] = 2 a[ 2n-2 ] + 2 a[ n ] for n >= 3; a[ 2n ] = 2 a[ 2n-1 ] +a[ n ] - a[ n+1 ] for n >= 3

CROSSREFS

Sequence in context: A024506 A068033 A088052 this_sequence A051284 A001867 A000998

Adjacent sequences: A045690 A045691 A045692 this_sequence A045694 A045695 A045696

KEYWORD

nonn

AUTHOR

TORSTEN.SILLKE(AT)LHSYSTEMS.COM

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 8 18:40 EDT 2008. Contains 141013 sequences.


AT&T Labs Research