Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A089061
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A089061 a(0) = 5, a(1) = 7; for n>1, a(n) = a(n-1)+a(n-2)-(2n-2). +0
1
5, 7, 10, 13, 17, 22, 29, 39, 54, 77, 113, 170, 261, 407, 642, 1021, 1633, 2622, 4221, 6807, 10990, 17757, 28705, 46418, 75077, 121447, 196474, 317869, 514289, 832102, 1346333, 2178375, 3524646, 5702957, 9227537, 14930426, 24157893 (list; graph; listen)
OFFSET

0,1

FORMULA

a(n) = Fibonacci(n+1)+2n+4. - Ralf Stephan, Feb 24 2004

CROSSREFS

Cf. A088981, A000045.

Sequence in context: A024325 A060873 A112251 this_sequence A093115 A020936 A025074

Adjacent sequences: A089058 A089059 A089060 this_sequence A089062 A089063 A089064

KEYWORD

nonn

AUTHOR

Kurmang. Aziz. Rashid (Kurmang.Rashid(AT)Btopenworld.com), Dec 02 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 December 8 08:31 EST 2009. Contains 170430 sequences.


AT&T Labs Research