Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A015447
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A015447 Generalized Fibonacci numbers: a(n) = a(n-1) + 11 a(n-2). +0
6
1, 1, 12, 23, 155, 408, 2113, 6601, 29844, 102455, 430739, 1557744, 6295873, 23431057, 92685660, 350427287, 1369969547, 5224669704, 20294334721, 77765701465, 301003383396, 1156426099511, 4467463316867, 17188150411488 (list; graph; listen)
OFFSET

0,3

FORMULA

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

a(n-1)=(1/3)*(-1)^n*sum(i=0, n, (-3)^i*F(i)*C(n, i)) - Benoit Cloitre (benoit7848c(AT)orange.fr), Mar 06 2004

a(n)=Sum_{k, 0<=k<=n} A109466(n,k)*(-11)^(n-k). [From Philippe DELEHAM (kolotoko(AT)wanadoo.fr), Oct 26 2008]

PROGRAM

(Other) sage: [lucas_number1(n, 1, -11) for n in xrange(0, 27)] # [From Zerinvary Lajos (zerinvarylajos(AT)yahoo.com), Apr 22 2009]

CROSSREFS

Cf. A015446, A015443.

Sequence in context: A049852 A045532 A083683 this_sequence A072822 A059161 A133491

Adjacent sequences: A015444 A015445 A015446 this_sequence A015448 A015449 A015450

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


AT&T Labs Research