login
The OEIS Foundation is supported by donations from users of the OEIS and by a grant from the Simons Foundation.

 

Logo

Year-end appeal: Please make a donation to the OEIS Foundation to support ongoing development and maintenance of the OEIS. We are now in our 56th year, we are closing in on 350,000 sequences, and we’ve crossed 9,700 citations (which often say “discovered thanks to the OEIS”).

Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A045693 Number of binary words of length n (beginning 0) with autocorrelation function 2^(n-1)+3. 0
0, 0, 1, 0, 1, 3, 6, 11, 23, 44, 91, 179, 364, 723, 1457, 2902, 5827, 11633, 23310, 46573, 93237, 186386, 372951, 745717, 1491798, 2983237, 5967197, 11933660, 23868777, 47736109, 95475120, 190947315, 381900457, 763795108, 1527601849, 3055192021, 6110407352 (list; graph; refs; listen; history; text; internal format)
OFFSET

1,6

LINKS

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

FORMULA

a(2*n-1) = 2*a(2*n-2) + a(n) for n>=3; a(2*n) = 2*a(2*n-1) + a(n) - a(n+1) for n>=3. [Corrected by Sean A. Irvine, Mar 18 2021]

CROSSREFS

Sequence in context: A293364 A287425 A088052 * A051284 A319910 A346050

Adjacent sequences:  A045690 A045691 A045692 * A045694 A045695 A045696

KEYWORD

nonn

AUTHOR

TORSTEN.SILLKE(AT)LHSYSTEMS.COM

EXTENSIONS

More terms from Sean A. Irvine, Mar 18 2021

STATUS

approved

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

License Agreements, Terms of Use, Privacy Policy. .

Last modified December 6 20:22 EST 2021. Contains 349567 sequences. (Running on oeis4.)