Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A128535
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A128535 F(n)*L(n-2) where F=Fibonacci and L=Lucas numbers. +0
4
0, -1, 2, 2, 9, 20, 56, 143, 378, 986, 2585, 6764, 17712, 46367, 121394, 317810, 832041, 2178308, 5702888, 14930351, 39088170 (list; graph; listen)
OFFSET

0,3

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*(-1+4*x)/((1+x)*(x^2-3*x+1)). [From R. J. Mathar (mathar(AT)strw.leidenuniv.nl), Apr 16 2009]

EXAMPLE

a(7) = 143 because F(7)*L(5) = 13*11.

CROSSREFS

Cf. A001906, A081714, A128533, A128534.

Sequence in context: A039796 A007024 A019223 this_sequence A081086 A019514 A135816

Adjacent sequences: A128532 A128533 A128534 this_sequence A128536 A128537 A128538

KEYWORD

easy,sign

AUTHOR

Axel Harvey (ax(AT)hirsig.ca), Mar 09 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 November 25 20:09 EST 2009. Contains 167514 sequences.


AT&T Labs Research