Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A015440
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A015440 Generalized Fibonacci numbers. +0
7
1, 1, 6, 11, 41, 96, 301, 781, 2286, 6191, 17621, 48576, 136681, 379561, 1062966, 2960771, 8275601, 23079456, 64457461, 179854741, 502142046, 1401415751, 3912125981, 10919204736, 30479834641, 85075858321, 237475031526 (list; graph; listen)
OFFSET

0,3

LINKS

Joerg Arndt, Fxtbook

FORMULA

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

a(n)={[ (1+sqrt(21))/2 ]^(n+1) - [ (1-sqrt(21))/2 ]^(n+1)}/sqrt(21).

a(n)=sum(k=0, ceil(n/2), 5^k*binomial(n-k, k)) - Benoit Cloitre (benoit7848c(AT)orange.fr), Mar 06 2004

G.f.: 1/(1-x-5x^2). [From R. J. Mathar (mathar(AT)strw.leidenuniv.nl), Sep 03 2008]

CROSSREFS

Cf. A006130, A006131, A015441.

Adjacent sequences: A015437 A015438 A015439 this_sequence A015441 A015442 A015443

Sequence in context: A108698 A002570 A038265 this_sequence A094555 A099437 A077701

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 11 13:47 EDT 2008. Contains 144830 sequences.


AT&T Labs Research