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
A120727 a(n) = a(n-1) + a(n-2), starting with 110, 211. +0
1
110, 211, 321, 532, 853, 1385, 2238, 3623, 5861, 9484, 15345, 24829, 40174, 65003, 105177, 170180, 275357, 445537, 720894, 1166431, 1887325, 3053756, 4941081, 7994837, 12935918, 20930755, 33866673, 54797428, 88664101, 143461529 (list; graph; listen)
OFFSET

1,1

LINKS

Tanya Khovanova, Recursive Sequences

FORMULA

a(0)=101, a(1)=110, a(n)=a(n-1)+a(n-2)

G.f.: (110*x+101*x^2)/(1-x-x^2). [From Philippe DELEHAM (kolotoko(AT)wanadoo.fr), Nov 20 2008]

MATHEMATICA

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}]

CROSSREFS

Cf. A000045.

Sequence in context: A146081 A103652 A032614 this_sequence A134213 A028995 A158539

Adjacent sequences: A120724 A120725 A120726 this_sequence A120728 A120729 A120730

KEYWORD

nonn

AUTHOR

Roger Bagula (rlbagulatftn(AT)yahoo.com), Aug 19 2006

EXTENSIONS

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


AT&T Labs Research