login
This site is supported by donations to The OEIS Foundation.

 

Logo

Annual Appeal: Please make a donation to keep the OEIS running. In 2018 we replaced the server with a faster one, added 20000 new sequences, and reached 7000 citations (often saying "discovered thanks to the OEIS").
Other ways to donate

Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A045696 Number of ternary words of length n (beginning 0) with autocorrelation function 2^(n-1)+2. 0
0, 0, 0, 2, 6, 16, 54, 154, 480, 1418, 4302, 12836, 38670, 115802, 347868 (list; graph; refs; listen; history; text; internal format)
OFFSET

1,4

LINKS

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

FORMULA

a[ 2n ] = 3 a[ 2n-1 ] - a[ n ] - a[ n+1 ] for n >= 3; a[ 2n-1 ] = 3 a[ 2n-2 ] + 3 a[ n ] for n >= 3

CROSSREFS

Sequence in context: A263591 A218779 A241066 * A150028 A147730 A147729

Adjacent sequences:  A045693 A045694 A045695 * A045697 A045698 A045699

KEYWORD

nonn

AUTHOR

TORSTEN.SILLKE(AT)LHSYSTEMS.COM

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 12 07:07 EST 2018. Contains 318053 sequences. (Running on oeis4.)