Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A096658
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A096658 a(n) = (2^n)*a(n-1) + (2^(n-1))*a(n-2), a(0)=1, a(1)=2. +0
2
1, 2, 10, 88, 1488, 49024, 3185152, 410836992, 105581969408, 54163142606848, 55517115997749248, 113754516621419872256, 466052199134899187220480, 3818365553813175477506932736, 62563919133290380117615296118784 (list; graph; listen)
OFFSET

0,2

COMMENT

This is the sequence of denominators of self-convergents to the number 1.40861... whose self-continued fraction is (1,2,4,8,16,...). See A096657 for numerators and A096654 for definitions.

FORMULA

a(n) is asymptotic to c*2^(n(n+1)/2) where c=1.54241381761010214381886547... - from More terms from Benoit Cloitre (benoit7848c(AT)orange.fr), Jul 01 2004

MATHEMATICA

a[0]=1; a[1]=2; a[n_] := (2^n)*a[n-1] + (2^(n-1))*a[n-2]; Table[ a[n], {n, 0, 14}] (from Robert G. Wilson v Jul 03 2004)

CROSSREFS

Cf. A000079, A096654, A096657.

Sequence in context: A111811 A144002 A060350 this_sequence A055779 A067550 A086587

Adjacent sequences: A096655 A096656 A096657 this_sequence A096659 A096660 A096661

KEYWORD

nonn

AUTHOR

Clark Kimberling (ck6(AT)evansville.edu), Jul 01 2004

EXTENSIONS

More terms from Benoit Cloitre (benoit7848c(AT)orange.fr), Jul 02 2004

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 25 20:09 EST 2009. Contains 167514 sequences.


AT&T Labs Research