Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A045695
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A045695 Number of ternary words of length n (beginning 0) with autocorrelation function 2^(n-1)+1. +0
1
0, 1, 2, 8, 22, 70, 202, 622, 1844, 5576, 16658, 50114, 150140, 450824, 1351850 (list; graph; listen)
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

CROSSREFS

Sequence in context: A137104 A137103 A089586 this_sequence A106053 A121135 A072929

Adjacent sequences: A045692 A045693 A045694 this_sequence A045696 A045697 A045698

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