Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A045697
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A045697 Number of ternary words of length n (beginning 0) with autocorrelation function 2^(n-1)+3. +0
1
0, 0, 1, 0, 2, 8, 24, 70, 214, 638, 1930, 5782, 17394, 52160, 156620 (list; graph; listen)
OFFSET

1,5

FORMULA

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

CROSSREFS

Sequence in context: A097064 A018045 A050242 this_sequence A131569 A066973 A130495

Adjacent sequences: A045694 A045695 A045696 this_sequence A045698 A045699 A045700

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 December 5 08:23 EST 2009. Contains 170348 sequences.


AT&T Labs Research