Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A081714
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A081714 F(n)L(n+1) where F=Fibonacci and L=Lucas numbers. +0
4
0, 3, 4, 14, 33, 90, 232, 611, 1596, 4182, 10945, 28658, 75024, 196419, 514228, 1346270, 3524577, 9227466, 24157816, 63245987, 165580140, 433494438, 1134903169, 2971215074, 7778742048, 20365011075, 53316291172 (list; graph; listen)
OFFSET

0,2

COMMENT

Also convolution of Fibonacci and Lucas numbers.

FORMULA

G.f.: x(3-2x)/((1+x)(1-3x+x^2)).

PROGRAM

(PARI) for(n=0, 50, print1(polcoeff(serconvol(Ser((1+2*x)/(1-x-x*x)), Ser(x/(1-x-x*x))), n)", "))

(PARI) a(n)=fibonacci(n)*(fibonacci(n+2)+fibonacci(n))

CROSSREFS

Cf. A000045, A000204.

Adjacent sequences: A081711 A081712 A081713 this_sequence A081715 A081716 A081717

Sequence in context: A110565 A057433 A006074 this_sequence A117718 A086826 A130409

KEYWORD

nonn,easy

AUTHOR

Ralf Stephan (ralf(AT)ark.in-berlin.de), Apr 03 2003

EXTENSIONS

Simpler definition from Michael Somos, Mar 16 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 October 7 14:39 EDT 2008. Contains 144666 sequences.


AT&T Labs Research