Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A001060
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
%I A001060 M1338 N0512
%S A001060 2,5,7,12,19,31,50,81,131,212,343,555,898,1453,2351,3804,6155,9959,
%T A001060 16114,26073,42187,68260,110447,178707,289154,467861,757015,1224876,
%U A001060 1981891,3206767,5188658,8395425,13584083,21979508,35563591,57543099
%N A001060 a(n) = a(n-1) + a(n-2).
%D A001060 N. J. A. Sloane and Simon Plouffe, The Encyclopedia of Integer Sequences, 
               Academic Press, 1995 (includes this sequence).
%D A001060 N. J. A. Sloane, A Handbook of Integer Sequences, Academic Press, 1973 
               (includes this sequence).
%D A001060 S. Plouffe, Approximations de S\'{e}ries G\'{e}n\'{e}ratrices et Quelques 
               Conjectures, Dissertation, Universit\'{e} du Qu\'{e}bec \`{a} Montr\'{e}al, 
               1992.
%D A001060 A. Brousseau, Seeking the lost gold mine or exploring Fibonacci factorizations, 
               Fib. Quart., 3 (1965), 129-130.
%D A001060 A. Brousseau, Fibonacci and Related Number Theoretic Tables. Fibonacci 
               Association, San Jose, CA, 1972, p. 52.
%H A001060 <a href="Sindx_Rea.html#recLCC">Index entries for sequences related to 
               linear recurrences with constant coefficients</a>
%H A001060 S. Plouffe, <a href="http://www.lacim.uqam.ca/%7Eplouffe/articles/MasterThesis.pdf">
               Approximations de S\'{e}ries G\'{e}n\'{e}ratrices et Quelques Conjectures</
               a>, Dissertation, Universit\'{e} du Qu\'{e}bec \`{a} Montr\'{e}al, 
               1992.
%H A001060 S. Plouffe, <a href="http://www.lacim.uqam.ca/%7Eplouffe/articles/FonctionsGeneratrices.pdf">
               1031 Generating Functions and Conjectures</a>, Universit\'{e} du 
               Qu\'{e}bec \`{a} Montr\'{e}al, 1992.
%H A001060 Tanya Khovanova, <a href="http://www.tanyakhovanova.com/RecursiveSequences/
               RecursiveSequences.html">Recursive Sequences</a>
%F A001060 a(n)=2*fibonacci(n-3)+fibonacci(n), n>=3. - Zerinvary Lajos (zerinvarylajos(AT)yahoo.com), 
               Oct 05 2007
%p A001060 with(combinat):a:=n->2*fibonacci(n-3)+fibonacci(n): seq(a(n), n=3..38); 
               - Zerinvary Lajos (zerinvarylajos(AT)yahoo.com), Oct 05 2007
%p A001060 A001060:=-(2+3*z)/(-1+z+z**2); [Conjectured by S. Plouffe in his 1992 
               dissertation.]
%t A001060 Table[a=Fibonacci[n+5]-Fibonacci[n],{n,-1,60}] [From Vladimir Orlovsky 
               (4vladimir(AT)gmail.com), Nov 23 2009]
%Y A001060 Apart from initial term, same as A013655.
%Y A001060 Sequence in context: A005895 A135525 A117538 this_sequence A042343 A042691 
               A112732
%Y A001060 Adjacent sequences: A001057 A001058 A001059 this_sequence A001061 A001062 
               A001063
%K A001060 nonn,new
%O A001060 0,1
%A A001060 N. J. A. Sloane (njas(AT)research.att.com).
%E A001060 More terms from James A. Sellers (sellersj(AT)math.psu.edu), May 04 2000

    
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 25 20:09 EST 2009. Contains 167514 sequences.


AT&T Labs Research