Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A045696
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A045696 Number of ternary words of length n (beginning 0) with autocorrelation function 2^(n-1)+2. +0
1
0, 0, 0, 2, 6, 16, 54, 154, 480, 1418, 4302, 12836, 38670, 115802, 347868 (list; graph; listen)
OFFSET

1,4

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: A136509 A100664 A003446 this_sequence A150028 A147730 A147729

Adjacent sequences: A045693 A045694 A045695 this_sequence A045697 A045698 A045699

KEYWORD

nonn

AUTHOR

TORSTEN.SILLKE(AT)LHSYSTEMS.COM

page 1

Search completed in 0.002 seconds

Lookup | Welcome | Find friends | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Transforms | Puzzles | Hot | Classics
More pages | Superseeker | Maintained by N. J. A. Sloane (njas@research.att.com)

Last modified November 27 22:38 EST 2009. Contains 167602 sequences.


AT&T Labs Research