Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A081011
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
%I A081011
%S A081011 4,15,91,612,4183,28659,196420,1346271,9227467,63245988,433494439,
%T A081011 2971215075,20365011076,139583862447,956722026043,6557470319844,
%U A081011 44945570212855,308061521170131,2111485077978052,14472334024676223
%N A081011 Fibonacci(4n+3)+2, or Fibonacci(2n+3)*Lucas(2n).
%D A081011 Hugh C. Williams, Edouard Lucas and Primality Testing, John Wiley and 
               Sons, 1998, p. 75
%F A081011 a(n) = 8a(n-1)-8a(n-2)+a(n-3)
%F A081011 a(n)=2+[(7/2)-(3/2)*sqrt(5)]^n+[(7/2)+(3/2)*sqrt(5)]^n+(2/5)*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 A081011 with(combinat) for n from 0 to 25 do printf(`%d,`,fibonacci(4*n+3)+2) 
               od
%Y A081011 Cf. A000045 (Fibonacci numbers), A000032 (Lucas numbers).
%Y A081011 Sequence in context: A034496 A079155 A076900 this_sequence A008829 A013193 
               A040025
%Y A081011 Adjacent sequences: A081008 A081009 A081010 this_sequence A081012 A081013 
               A081014
%K A081011 nonn,easy
%O A081011 0,1
%A A081011 R. K. Guy (rkg(AT)cpsc.ucalgary.ca), Mar 01, 2003
%E A081011 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 November 30 13:13 EST 2009. Contains 167758 sequences.


AT&T Labs Research