Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A015581
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A015581 a(n) = 9 a(n-1) + 5 a(n-2). +0
2
0, 1, 9, 86, 819, 7801, 74304, 707741, 6741189, 64209406, 611590599, 5825362421, 55486214784, 528502745161, 5033955780369, 47948115749126, 456702820643979, 4350065964541441, 41434107784092864 (list; graph; listen)
OFFSET

0,3

FORMULA

A linear 2nd order recurrence.

O.g.f: -x/(-1+9*x+5*x^2) . - R. J. Mathar (mathar(AT)strw.leidenuniv.nl), Dec 02 2007

a(n)=(1/101)*sqrt(101)*{[(9/2)+(1/2)*sqrt(101)]^n-[(9/2)-(1/2)*sqrt(101)]^n}, with n>=0 [From Paolo P. Lava (ppl(AT)spl.at), Jan 13 2009]

PROGRAM

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

CROSSREFS

Sequence in context: A152106 A142982 A029711 this_sequence A152261 A028339 A100814

Adjacent sequences: A015578 A015579 A015580 this_sequence A015582 A015583 A015584

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