login

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 61st year, we have over 378,000 sequences, and we’ve reached 11,000 citations (which often say “discovered thanks to the OEIS”).

Number of binary words of length n (beginning 0) with autocorrelation function 2^(n-1)+3.
0

%I #6 Mar 18 2021 23:28:39

%S 0,0,1,0,1,3,6,11,23,44,91,179,364,723,1457,2902,5827,11633,23310,

%T 46573,93237,186386,372951,745717,1491798,2983237,5967197,11933660,

%U 23868777,47736109,95475120,190947315,381900457,763795108,1527601849,3055192021,6110407352

%N Number of binary words of length n (beginning 0) with autocorrelation function 2^(n-1)+3.

%F 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]

%K nonn

%O 1,6

%A TORSTEN.SILLKE(AT)LHSYSTEMS.COM

%E More terms from _Sean A. Irvine_, Mar 18 2021