Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A045692
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A045692 Number of binary words of length n (beginning 0) with autocorrelation function 2^(n-1)+2. +0
1
0, 0, 0, 1, 2, 3, 8, 13, 30, 55, 116, 221, 458, 895, 1816, 3589, 7238, 14391, 28892 (list; graph; listen)
OFFSET

1,5

FORMULA

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

CROSSREFS

Sequence in context: A004138 A116503 A105204 this_sequence A103196 A113954 A025082

Adjacent sequences: A045689 A045690 A045691 this_sequence A045693 A045694 A045695

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 August 19 23:53 EDT 2008. Contains 142930 sequences.


AT&T Labs Research