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

Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A081072 Fibonacci(4n) + 3, or Fibonacci(2n+2)*Lucas(2n-2). 0
3, 6, 24, 147, 990, 6768, 46371, 317814, 2178312, 14930355, 102334158, 701408736, 4807526979, 32951280102, 225851433720, 1548008755923, 10610209857726, 72723460248144, 498454011879267, 3416454622906710, 23416728348467688 (list; graph; refs; listen; history; internal format)
OFFSET

0,1

REFERENCES

Hugh C. Williams, Edouard Lucas and Primality Testing, John Wiley and Sons, 1998, p. 75

LINKS

Index to sequences with linear recurrences with constant coefficients, signature (8,-8,1). [From R. J. Mathar (mathar(AT)strw.leidenuniv.nl), Sep 03 2010]

FORMULA

a(n) = 8a(n-1)-8a(n-2)+a(n-3)

a(n)=3+(1/5)*sqrt(5)*{[(7/2)+(3/2)*sqrt(5)]^n-[(7/2)-(3/2)*sqrt(5)]^n}, with n>=0 [From Paolo P. Lava (paoloplava(AT)gmail.com), Dec 01 2008]

G.f.: ( -3+18*x ) / ( (x-1)*(x^2-7*x+1) ). a(n) = 3+A033888(n). [From R. J. Mathar (mathar(AT)strw.leidenuniv.nl), Sep 03 2010]

MAPLE

with(combinat): for n from 0 to 40 do printf(`%d, `, fibonacci(4*n)+3) od:

PROG

(MAGMA) [Fibonacci(4*n)+3: n in [0..50]]; // Vincenzo Librandi, Apr 20 2011

CROSSREFS

Cf. A000045 (Fibonacci numbers).

Sequence in context: A132390 A152761 A109155 * A000717 A076020 A018964

Adjacent sequences:  A081069 A081070 A081071 * A081073 A081074 A081075

KEYWORD

nonn,easy

AUTHOR

R. K. Guy (rkg(AT)cpsc.ucalgary.ca), Mar 04, 2003

EXTENSIONS

More terms and Maple code from James A. Sellers (sellersj(AT)math.psu.edu), Mar 05, 2003

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

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

Last modified February 17 15:44 EST 2012. Contains 206050 sequences.