login
This site is supported by donations to The OEIS Foundation.
Logo

Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A096657 a(n) = (2^n)*a(n-1) + (2^(n-1))*a(n-2), a(0)=1, a(1)=3. 2
1, 3, 14, 124, 2096, 69056, 4486656, 578711552, 148724449280, 76295068188672, 78202296743231488, 160236429879963287552, 656488575092059763900416, 5378610735570941915498020864, 88128536246001466497105446043648 (list; graph; refs; listen; history; internal format)
OFFSET

0,2

COMMENTS

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

FORMULA

a(n) is asymptotic to c*2^(n(n+1)/2) where c=2.1726687508496636560169136... - Benoit Cloitre (benoit7848c(AT)orange.fr), Jul 02 2004

EXAMPLE

a(2)=4*3+2*1=14, a(3)=8*14+4*3=124.

MATHEMATICA

a[0] = 1; a[1] = 3; 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, A096658.

Sequence in context: A127850 A186772 A061029 * A126933 A073550 A002966

Adjacent sequences:  A096654 A096655 A096656 * A096658 A096659 A096660

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

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Transforms | Puzzles | Hot | Classics
Recent Additions | More pages | Superseeker | Maintained by The OEIS Foundation Inc.

Content is available under The OEIS End-User License Agreement .

Last modified February 16 16:39 EST 2012. Contains 205938 sequences.