Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A081010
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A081010 Fibonacci(4n+1)+2, or Fibonacci(2n-1)*Lucas(2n+2). +0
1
3, 7, 36, 235, 1599, 10948, 75027, 514231, 3524580, 24157819, 165580143, 1134903172, 7778742051, 53316291175, 365435296164, 2504730781963, 17167680177567, 117669030460996, 806515533049395, 5527939700884759 (list; graph; listen)
OFFSET

0,1

REFERENCES

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

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

MAPLE

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

CROSSREFS

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

Adjacent sequences: A081007 A081008 A081009 this_sequence A081011 A081012 A081013

Sequence in context: A047158 A102917 A049366 this_sequence A100377 A049493 A020463

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

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 October 15 09:18 EDT 2008. Contains 145015 sequences.


AT&T Labs Research