Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A075269
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A075269 Product of Lucas numbers and inverted Lucas numbers: a(n)=A000032(n)*A075193(n). +0
1
2, -3, 12, -28, 77, -198, 522, -1363, 3572, -9348, 24477, -64078, 167762, -439203, 1149852, -3010348, 7881197, -20633238, 54018522, -141422323, 370248452, -969323028, 2537720637, -6643838878, 17393796002, -45537549123, 119218851372, -312119004988, 817138163597 (list; graph; listen)
OFFSET

0,1

COMMENT

a(n)=((-1)^n)L(2n+1)+1, L(n)=Lucas numbers.

FORMULA

G.f.: (2+x+2x^2)/((1+3x+x^2)(1-x)). a(n)=-3a(n-1)-a(n-2)+5=-2a(n-1)+2a(n-2)+a(n-3)=a(-1-n). - Michael Somos, Apr 07 2003

a(n)=1+(1/2)*[ -3/2-(1/2)*sqrt(5)]^n+(1/2)*[ -3/2-(1/2)*sqrt(5)]^n*sqrt(5)-(1/2)*[ -3/2+(1/2) *sqrt(5)]^n*sqrt(5)+(1/2)*[ -3/2+(1/2)*sqrt(5)]^n, with n>=0 - Paolo P. Lava (ppl(AT)spl.at), Jun 12 2008

MATHEMATICA

CoefficientList[Series[(2 + x + 2x^2)/(1 + 2x - 2x^2 - x^3), {x, 0, 30}], x]

PROGRAM

(PARI) a(n)=1+(-1)^n*(fibonacci(n+1)+fibonacci(n-1))

CROSSREFS

Cf. A000032, A075193.

Sequence in context: A049601 A016021 A136703 this_sequence A089414 A048085 A069062

Adjacent sequences: A075266 A075267 A075268 this_sequence A075270 A075271 A075272

KEYWORD

easy,sign,new

AUTHOR

Mario Catalani (mario.catalani(AT)unito.it), Sep 11 2002

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 July 6 17:22 EDT 2008. Contains 140988 sequences.


AT&T Labs Research