login
This site is supported by donations to The OEIS Foundation.

 

Logo

Many excellent designs for a new banner were submitted. We will use the best of them in rotation.

Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A045692 Number of binary words of length n (beginning 0) with autocorrelation function 2^(n-1)+2. 0
0, 0, 0, 1, 2, 3, 8, 13, 30, 55, 116, 221, 458, 895, 1816, 3589, 7238, 14391, 28892 (list; graph; refs; listen; history; text; internal format)
OFFSET

1,5

LINKS

Table of n, a(n) for n=1..19.

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: A221181 A116503 A105204 * A103196 A113954 A191393

Adjacent sequences:  A045689 A045690 A045691 * A045693 A045694 A045695

KEYWORD

nonn

AUTHOR

TORSTEN.SILLKE(AT)LHSYSTEMS.COM

STATUS

approved

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Transforms | Superseeker | Recent | More pages
The OEIS Community | Maintained by The OEIS Foundation Inc.

Content is available under The OEIS End-User License Agreement .

Last modified April 21 02:07 EDT 2014. Contains 240824 sequences.