Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A135032
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A135032 Generalized Fibonacci numbers: a(n) = 6*a(n-1) + 4*a(n-2). +0
1
0, 1, 6, 40, 264, 1744, 11520, 76096, 502656, 3320320, 21932544, 144876544, 956989440, 6321442816, 41756614656, 275825459200, 1821979213824, 12035177119744, 79498979573760, 525134585921536, 3468803433824256 (list; graph; listen)
OFFSET

0,3

FORMULA

a(0)=0; a(1)=1; a(n)=2*(3*a(n-1)+2*a(n-2)). a(n)=1/(2*sqrt(13))*((3+sqrt(13))^n-(3-sqrt(13))^n).

CROSSREFS

Adjacent sequences: A135029 A135030 A135031 this_sequence A135033 A135034 A135035

Sequence in context: A026077 A065113 A052518 this_sequence A122074 A123357 A081016

KEYWORD

nonn,easy

AUTHOR

Rolf Pleisch (r_pleisch(AT)gmx.ch), Feb 10 2008, corrected Feb 14 2008

EXTENSIONS

More terms from Alexis Olson (AlexisOlson(AT)gmail.com), Nov 15 2008

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 January 8 02:43 EST 2009. Contains 152824 sequences.


AT&T Labs Research