Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A128533
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A128533 F(n)*L(n+2) where F=Fibonacci and L=Lucas numbers. +0
3
0, 4, 7, 22, 54, 145, 376, 988, 2583, 6766, 17710, 46369, 121392, 317812, 832039, 2178310, 5702886, 14930353, 39088168, 102334156, 267914295 (list; graph; listen)
OFFSET

0,2

COMMENT

Generally, F(n)*L(n+k) = F(2*n + k) + F(k)*(-1)^(n+1). If k=0 the sequence is A001906; if k=1 it is A081714.

FORMULA

a(n) = F(2*(n+1)) + (-1)^(n+1), assuming F(0)=0 and L(0)=2

a(n)=2*a(n-1)+2*a(n-2)-a(n-3). G.f.: -x*(-4+x)/((1+x)*(x^2-3*x+1)). [From R. J. Mathar (mathar(AT)strw.leidenuniv.nl), Apr 16 2009]

EXAMPLE

a(4)=54 because F(4)*L(6)=3*18.

CROSSREFS

Cf. A001906, A081714, A128534, A128535.

Sequence in context: A026548 A127361 A100098 this_sequence A162559 A126094 A073114

Adjacent sequences: A128530 A128531 A128532 this_sequence A128534 A128535 A128536

KEYWORD

easy,nonn

AUTHOR

Axel Harvey (ax(AT)hirsig.ca), Mar 08 2007

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 December 1 19:22 EST 2009. Contains 167811 sequences.


AT&T Labs Research