login
The OEIS is supported by the many generous donors to the OEIS Foundation.

 

Logo
Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A045697 Number of ternary words of length n (beginning 0) with autocorrelation function 2^(n-1)+3. 0

%I #6 Mar 18 2021 23:29:08

%S 0,0,1,0,2,8,24,70,214,638,1930,5782,17394,52160,156620,469786,

%T 1409786,4229148,12688720,38065506,114200378,342599212,1027809200,

%U 3083421770,9250300098,27750882922,83252753086,249758206958,749274934114,2247824645796,6743474876960

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

%F a(2*n) = 3*a(2*n-1) + 2*a(n) - a(n+1) for n>=3; a(2*n-1) = 3*a(2*n-2) + 2*a(n) for n>=3.

%K nonn

%O 1,5

%A TORSTEN.SILLKE(AT)LHSYSTEMS.COM

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

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

License Agreements, Terms of Use, Privacy Policy. .

Last modified April 24 10:00 EDT 2024. Contains 371935 sequences. (Running on oeis4.)