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

Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A085695 a(n) = F(n) F(3n) / 2, where F(n) = Fibonacci number (A000045). 0
0, 1, 4, 34, 216, 1525, 10336, 71149, 486864, 3339106, 22881100, 156843721, 1074985344, 7368157369, 50501844796, 346145466850, 2372514562656, 16261461342589, 111457702083424, 763942486626661, 5236139616899400 (list; graph; refs; listen; history; internal format)
OFFSET

0,3

FORMULA

G.f.: ( x - x^3 )/( 1 - 4 x - 19 x^2 - 4 x^3 + x^4 ) Recurrence: a(n+4) = 4 a(n+3) + 19 a(n+2) + 4 a(n+1) - a(n)

PROG

(Mupad) numlib::fibonacci(3*n)*numlib::fibonacci(n)/2 $ n = 0..35; - Zerinvary Lajos (zerinvarylajos(AT)yahoo.com), May 13 2008

CROSSREFS

Sequence in context: A129557 A196908 A197075 * A049293 A198687 A116430

Adjacent sequences:  A085692 A085693 A085694 * A085696 A085697 A085698

KEYWORD

easy,nonn

AUTHOR

Emanuele Munarini (munarini(AT)mate.polimi.it), Jul 18 2003

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 21:51 EST 2012. Contains 205978 sequences.