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

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!)
 A045694 Number of ternary words of length n (beginning with 0) with autocorrelation function 2^(n-1). 1
 1, 2, 6, 16, 48, 138, 414, 1226, 3678, 10986, 32958, 98736, 296208, 888210, 2664630, 7992664, 23977992, 71930298, 215790894, 647361696, 1942085088, 5826222306, 17478666918, 52435902018, 157307706054, 471922821954, 1415768465862 (list; graph; refs; listen; history; text; internal format)
 OFFSET 1,2 LINKS FORMULA a(2n) = 3*a(2n-1) - a(n) for n >= 1; a(2n+1) = 3*a(2n) for n >= 1. MAPLE a:=proc(n) if n=1 then 1 elif n mod 2 = 0 then 3*a(n-1)-a(n/2) else 3*a(n-1) fi end: seq(a(n), n=1..31); # Emeric Deutsch, Aug 08 2005 CROSSREFS Equals A019308/3. Sequence in context: A148444 A064190 A151281 * A225178 A129772 A046721 Adjacent sequences:  A045691 A045692 A045693 * A045695 A045696 A045697 KEYWORD nonn,easy AUTHOR TORSTEN.SILLKE(AT)LHSYSTEMS.COM EXTENSIONS More terms from Emeric Deutsch, Aug 08 2005 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.

Last modified December 8 20:37 EST 2021. Contains 349596 sequences. (Running on oeis4.)