Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A111365
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A111365 a(n) = 5*a(n-1) + 3*a(n-2) where a(0) = a(1) = 1. +0
1
1, 1, 8, 43, 239, 1324, 7337, 40657, 225296, 1248451, 6918143, 38336068, 212434769, 1177182049, 6523214552, 36147618907, 200307738191, 1109981547676, 6150830952953, 34084099407793, 188872989897824, 1046617247712499 (list; graph; listen)
OFFSET

0,3

REFERENCES

Thomas Koshy, "Fibonacci and Lucas Numbers with Applications", Wiley, 2001

FORMULA

a(n)=(1/2)*[5/2-(1/2)*sqrt(37)]^n-(3/74)*[5/2+(1/2)*sqrt(37)]^n*sqrt(37)+(3/74)*[5/2-(1/2) *sqrt(37)]^n*sqrt(37)+(1/2)*[5/2+(1/2)*sqrt(37)]^n, with n>=0 [From Paolo P. Lava (ppl(AT)spl.at), Aug 01 2008]

EXAMPLE

a(2) = 5*a(1) + 3*a(0) = 5*1 + 3*1 = 8 which is the third term in the sequence.

CROSSREFS

Cf. A000045, A072264.

Sequence in context: A099253 A034361 A117617 this_sequence A144039 A044110 A044491

Adjacent sequences: A111362 A111363 A111364 this_sequence A111366 A111367 A111368

KEYWORD

nonn

AUTHOR

Parthasarathy Nambi (PachaNambi(AT)yahoo.com), Nov 07 2005

EXTENSIONS

More terms from Robert G. Wilson v (rgwv(at)rgwv.com), Nov 10 2005

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 18 20:14 EST 2008. Contains 147244 sequences.


AT&T Labs Research