Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A081012
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
%I A081012
%S A081012 3,32,231,1595,10944,75023,514227,3524576,24157815,165580139,1134903168,
%T A081012 7778742047,53316291171,365435296160,2504730781959,17167680177563,
%U A081012 117669030460992,806515533049391,5527939700884755,37889062373143904
%N A081012 Fibonacci(4n+1)-2, or Fibonacci(2n+2)*Lucas(2n-1).
%D A081012 Hugh C. Williams, Edouard Lucas and Primality Testing, John Wiley and 
               Sons, 1998, p. 75
%F A081012 a(n) = 8a(n-1)-8a(n-2)+a(n-3)
%F A081012 a(n)=-2+(5/2)*{[(7/2)-(3/2)*sqrt(5)]^n+[(7/2)+(3/2)*sqrt(5)]^n+(11/10)*sqrt(5)*{[(7/
               2)+(3/2)*sqrt(5)]^n-[(7/2)-(3/2)*sqrt(5)]^n}, with n>=0 [From Paolo 
               P. Lava (ppl(AT)spl.at), Dec 01 2008]
%p A081012 with(combinat) for n from 0 to 25 do printf(`%d,`,fibonacci(4*n+1)-2) 
               od
%Y A081012 Cf. A000045 (Fibonacci numbers), A000032 (Lucas numbers).
%Y A081012 Sequence in context: A004256 A002059 A028447 this_sequence A035533 A029502 
               A037792
%Y A081012 Adjacent sequences: A081009 A081010 A081011 this_sequence A081013 A081014 
               A081015
%K A081012 nonn,easy
%O A081012 1,1
%A A081012 R. K. Guy (rkg(AT)cpsc.ucalgary.ca), Mar 01, 2003
%E A081012 More terms and Maple code from James A. Sellers (sellersj(AT)math.psu.edu), 
               Mar 03, 2003

    
page 1

Search completed in 0.001 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 December 5 23:38 EST 2009. Contains 170428 sequences.


AT&T Labs Research