Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A015606
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A015606 a(n) = 11 a(n-1) + 10 a(n-2). +0
1
0, 1, 11, 131, 1551, 18371, 217591, 2577211, 30525231, 361549651, 4282298471, 50720779691, 600751561311, 7115474971331, 84277740297751, 998209892988571, 11823086225851791, 140036047414255411 (list; graph; listen)
OFFSET

0,3

FORMULA

a(n)=(1/161)*[11/2+(1/2)*sqrt(161)]^n*sqrt(161)-(1/161)*sqrt(161)*[11/2-(1/2)*sqrt(161)]^n , with n>=0 - Paolo P. Lava (ppl(AT)spl.at), Jul 09 2008

CROSSREFS

Sequence in context: A083763 A076255 A076357 this_sequence A077417 A082148 A075509

Adjacent sequences: A015603 A015604 A015605 this_sequence A015607 A015608 A015609

KEYWORD

nonn,easy,new

AUTHOR

Olivier Gerard (ogerard(AT)ext.jussieu.fr)

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 July 25 07:41 EDT 2008. Contains 142293 sequences.


AT&T Labs Research