[go: up one dir, main page]

login
A045695
Number of ternary words of length n (beginning 0) with autocorrelation function 2^(n-1)+1.
1
0, 1, 2, 8, 22, 70, 202, 622, 1844, 5576, 16658, 50114, 150140, 450824, 1351850, 4056794, 12168538, 36509302, 109522330, 328578142, 985717768, 2957186620, 8871509746, 26614629466, 79843738258, 239531515054, 718594094338
OFFSET
1,3
FORMULA
a(2n) = 3*a(2n-1) + 2*a(n) for n >= 2; a(2n-1) = 3*a(2n-2) - a(n) for n >= 2
MAPLE
A045695 := proc(n)
if n <=2 then
n-1 ;
elif type(n, 'even') then
3*procname(n-1)+2*procname(n/2) ;
else
3*procname(n-1)-procname((n+1)/2) ;
end if;
end proc: # R. J. Mathar, Oct 04 2014
MATHEMATICA
a[n_] := If[n <= 2, n-1,
If[EvenQ[n], 3*a[n-1] + 2*a[n/2],
3*a[n-1] - a[(n+1)/2]]];
Table[a[n], {n, 1, 27}] (* Jean-François Alcover, Mar 15 2024, after Maple code *)
CROSSREFS
Sequence in context: A137103 A089586 A339302 * A106053 A121135 A183410
KEYWORD
nonn
AUTHOR
TORSTEN.SILLKE(AT)LHSYSTEMS.COM
STATUS
approved