Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A015533
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A015533 a(n) = 4 a(n-1) + 9 a(n-2). +0
1
0, 1, 4, 25, 136, 769, 4300, 24121, 135184, 757825, 4247956, 23812249, 133480600, 748232641, 4194255964, 23511117625, 131792774176, 738771155329, 4141219588900, 23213818753561, 130126251314344, 729429374039425 (list; graph; listen)
OFFSET

0,3

FORMULA

O.g.f.: -x/(-1+4*x+9*x^2). a(n)=-9^n*(A^n-B^n)/(2sqrt(13)) where A=-1/(2+sqrt(13)) and B=1/(sqrt(13)-2) . - R. J. Mathar (mathar(AT)strw.leidenuniv.nl), Apr 29 2008

a(n)=Sum_{k, 0<=k<=n}A155161(n,k)*3^(n-k), n>=1 . [From Philippe DELEHAM (kolotoko(AT)wanadoo.fr), Jan 27 2009]

PROGRAM

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

CROSSREFS

Sequence in context: A013582 A123660 A156701 this_sequence A079291 A072221 A055846

Adjacent sequences: A015530 A015531 A015532 this_sequence A015534 A015535 A015536

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