Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A120727
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
%I A120727
%S A120727 110,211,321,532,853,1385,2238,3623,5861,9484,15345,24829,40174,65003,
%T A120727 105177,170180,275357,445537,720894,1166431,1887325,3053756,4941081,
%U A120727 7994837,12935918,20930755,33866673,54797428,88664101,143461529
%N A120727 a(n) = a(n-1) + a(n-2), starting with 110, 211.
%H A120727 Tanya Khovanova, <a href="http://www.tanyakhovanova.com/RecursiveSequences/
               RecursiveSequences.html">Recursive Sequences</a>
%F A120727 a(0)=101, a(1)=110, a(n)=a(n-1)+a(n-2)
%F A120727 G.f.: (110*x+101*x^2)/(1-x-x^2). [From Philippe DELEHAM (kolotoko(AT)wanadoo.fr), 
               Nov 20 2008]
%t A120727 d = 10 M = {{0, 1, 0}, {0, 0, 1}, {1, d, d^2}} v[n_] := Table[Fibonacci[n 
               + i], {i, 0, 2}] w[n_] := M.v[n] Table[w[n][[3]], {n, 0, 50}]
%Y A120727 Cf. A000045.
%Y A120727 Sequence in context: A146081 A103652 A032614 this_sequence A134213 A028995 
               A158539
%Y A120727 Adjacent sequences: A120724 A120725 A120726 this_sequence A120728 A120729 
               A120730
%K A120727 nonn
%O A120727 1,1
%A A120727 Roger Bagula (rlbagulatftn(AT)yahoo.com), Aug 19 2006
%E A120727 Edited by N. J. A. Sloane (njas(AT)research.att.com), Dec 04 2006

    
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 27 22:38 EST 2009. Contains 167602 sequences.


AT&T Labs Research