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

 

Logo

Annual Appeal: Today, Nov 11 2014, is the 4th anniversary of the launch of the new OEIS web site. 70,000 sequences have been added in these four years, all edited by volunteers. Please make a donation (tax deductible in the US) to help keep the OEIS running.

Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A080042 a(n) = 4*a(n-1)+3*a(n-2) for n>1, a(0)=2, a(1)=4. 5
2, 4, 22, 100, 466, 2164, 10054, 46708, 216994, 1008100, 4683382, 21757828, 101081458, 469599316, 2181641638, 10135364500, 47086382914, 218751625156, 1016265649366, 4721317472932, 21934066839826, 101900219778100 (list; graph; refs; listen; history; text; internal format)
OFFSET

0,1

COMMENTS

This is the Lucas sequence V(4,-3). [Bruno Berselli, Jan 09 2013]

LINKS

Vincenzo Librandi, Table of n, a(n) for n = 0..300

Wikipedia, Lucas sequence: Specific names.

FORMULA

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

a(n) = (2+sqrt(7))^n+(2-sqrt(7))^n.

G.f.: G(0)/x -2/x, where G(k)= 1 + 1/(1 - x*(7*k-4)/(x*(7*k+3) - 2/G(k+1))); (continued fraction). - Sergei N. Gladkovskii, Jun 03 2013

MATHEMATICA

CoefficientList[Series[(2 - 4 t)/(1 - 4 t - 3 t^2), {t, 0, 25}], t]

PROG

(Sage) [lucas_number2(n, 4, -3) for n in xrange(0, 22)]# [From Zerinvary Lajos, May 14 2009]

CROSSREFS

Cf. A015530: Lucas sequence U(4,-3).

Sequence in context: A071298 A152104 A047035 * A165588 A235938 A110130

Adjacent sequences:  A080039 A080040 A080041 * A080043 A080044 A080045

KEYWORD

nonn,easy

AUTHOR

Mario Catalani (mario.catalani(AT)unito.it), Jan 21 2003

STATUS

approved

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Transforms | Superseeker | Recent | More pages
The OEIS Community | Maintained by The OEIS Foundation Inc.

Content is available under The OEIS End-User License Agreement .

Last modified November 23 09:53 EST 2014. Contains 249840 sequences.