Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A045691
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A045691 Number of binary words of length n with autocorrelation function 2^(n-1)+1. +0
1
0, 1, 1, 3, 5, 11, 19, 41, 77, 159, 307, 625, 1231, 2481, 4921, 9883, 19689, 39455, 78751 (list; graph; listen)
OFFSET

0,4

FORMULA

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

CROSSREFS

Adjacent sequences: A045688 A045689 A045690 this_sequence A045692 A045693 A045694

Sequence in context: A089098 A129384 A131887 this_sequence A045961 A117272 A118744

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 October 13 02:37 EDT 2008. Contains 145008 sequences.


AT&T Labs Research