Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A015449
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A015449 Generalized Fibonacci numbers. +0
3
1, 1, 6, 31, 161, 836, 4341, 22541, 117046, 607771, 3155901, 16387276, 85092281, 441848681, 2294335686, 11913527111, 61861971241, 321223383316, 1667978887821, 8661117822421, 44973567999926, 233528957822051 (list; graph; listen)
OFFSET

0,3

LINKS

Joerg Arndt, Fxtbook

Tanya Khovanova, Recursive Sequences

FORMULA

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

a(n)=Sum_{k, 0<=k<=n}4^k*A055830(n,k) . - Philippe DELEHAM (kolotoko(AT)wanadoo.fr), Oct 18 2006

MAPLE

a[0]:=1: a[1]:=1: for n from 2 to 26 do a[n]:=5*a[n-1]+a[n-2] od: seq(a[n], n=0..21); - Zerinvary Lajos (zerinvarylajos(AT)yahoo.com), Jul 26 2006

CROSSREFS

Adjacent sequences: A015446 A015447 A015448 this_sequence A015450 A015451 A015452

Sequence in context: A047665 A003128 A058146 this_sequence A036729 A097176 A121754

KEYWORD

nonn,easy

AUTHOR

Olivier Gerard (olivier.gerard(AT)gmail.com)

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 October 9 14:06 EDT 2008. Contains 144831 sequences.


AT&T Labs Research