Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A098127
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A098127 Fibonacci sequence with a(1)=7 and a(2) = 26. +0
1
7, 26, 33, 59, 92, 151, 243, 394, 637, 1031, 1668, 2699, 4367, 7066, 11433, 18499, 29932, 48431, 78363, 126794, 205157, 331951, 537108, 869059, 1406167, 2275226, 3681393, 5956619, 9638012, 15594631, 25232643, 40827274, 66059917, 106887191 (list; graph; listen)
OFFSET

1,1

LINKS

Tanya Khovanova, Recursive Sequences

FORMULA

a(n) = a(n-1) + a(n-2)

G.f.=(7x+19x^2)/(1-x-x^2). - Emeric Deutsch (deutsch(AT)duke.poly.edu), Apr 16 2005

EXAMPLE

a(3) = a(2) + a(1) = 26 + 7 = 33

MAPLE

a[1]:=7:a[2]:=26: for n from 3 to 37 do a[n]:=a[n-1]+a[n-2] od: seq(a[n], n=1..37); (Deutsch)

CROSSREFS

Cf. A022136, A097657.

Sequence in context: A012490 A157702 A063453 this_sequence A131905 A110927 A103267

Adjacent sequences: A098124 A098125 A098126 this_sequence A098128 A098129 A098130

KEYWORD

nonn

AUTHOR

Parthasarathy Nambi (PachaNambi(AT)yahoo.com), Sep 26 2004

EXTENSIONS

More terms from Emeric Deutsch (deutsch(AT)duke.poly.edu), Apr 16 2005

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 December 7 08:40 EST 2009. Contains 170430 sequences.


AT&T Labs Research