Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A063782
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A063782 a(n) = f(n) + f(n-1), where f() = A063727. +0
1
3, 10, 32, 104, 336, 1088, 3520, 11392, 36864, 119296, 386048, 1249280, 4042752, 13082624, 42336256, 137003008, 443351040, 1434714112, 4642832384, 15024521216, 48620371968, 157338828800, 509159145472, 1647673606144 (list; graph; listen)
OFFSET

0,1

COMMENT

Ratio of successive terms approaches sqrt(5) + 1.

FORMULA

2^(n-1)*Fibonacci(n+3). - Vladeta Jovovic (vladeta(AT)Eunet.yu), Oct 25 2003

MAPLE

a := proc(n) option remember: if n=0 then RETURN(1) fi: if n=1 then RETURN(2) fi: 2*a(n-1) + 4*a(n-2); end: for n from 1 to 50 do printf(`%d, `, a(n)+a(n-1)) od:

CROSSREFS

Sequence in context: A134377 A077826 A033505 this_sequence A071718 A134952 A126183

Adjacent sequences: A063779 A063780 A063781 this_sequence A063783 A063784 A063785

KEYWORD

nonn

AUTHOR

Klaus E. Kastberg (kastberg(AT)hotkey.net.au), Aug 17 2001

EXTENSIONS

More terms from James A. Sellers (sellersj(AT)math.psu.edu), Sep 25 2001

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