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

Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A081010 Fibonacci(4n+1)+2, or Fibonacci(2n-1)*Lucas(2n+2). 1
3, 7, 36, 235, 1599, 10948, 75027, 514231, 3524580, 24157819, 165580143, 1134903172, 7778742051, 53316291175, 365435296164, 2504730781963, 17167680177567, 117669030460996, 806515533049395, 5527939700884759, 37889062373143908, 259695496911122587 (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

Nathaniel Johnston, Table of n, a(n) for n = 0..500

FORMULA

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

a(n) = 2 + .5[A001906(n+1)]^2 + .5[A001519(n)]^2 - Creighton Dement (creighton.k.dement(AT)uni-oldenburg.de), Aug 15 2004

a(n)=2+(1/2)*{[(7/2)-(3/2)*sqrt(5)]^n+[(7/2)+(3/2)*sqrt(5)]^n}+(1/10)*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]

MAPLE

with(combinat) for n from 0 to 25 do printf(`%d, `, fibonacci(4*n+1)+2) od

PROG

(MAGMA) [Fibonacci(4*n+1) +2: n in [0..100]]; // Vincenzo Librandi, Apr 15 2011

CROSSREFS

Cf. A000045 (Fibonacci numbers), A000032 (Lucas numbers).

Sequence in context: A102917 A156465 A049366 * A100377 A167169 A199347

Adjacent sequences:  A081007 A081008 A081009 * A081011 A081012 A081013

KEYWORD

nonn,easy

AUTHOR

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

EXTENSIONS

More terms and Maple code from James A. Sellers (sellersj(AT)math.psu.edu), Mar 03, 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 14 20:38 EST 2012. Contains 205663 sequences.