id:A099921 - OEIS Search Results

Search: id:A099921

Displaying 1-1 of 1 results found.

page 1

5*F(n)^2, F(n) = Fibonacci numbers A000045.

+0
1

5, 5, 20, 45, 125, 320, 845, 2205, 5780, 15125, 39605, 103680, 271445, 710645, 1860500, 4870845, 12752045, 33385280, 87403805, 228826125, 599074580, 1568397605, 4106118245, 10749957120, 28143753125, 73681302245 (list; graph; listen)

	OFFSET	`1,1`
	REFERENCES	`A. T. Benjamin and J. J. Quinn, Proofs that really count: the art of combinatorial proof, M.A.A. 2003, id. 53.`
	FORMULA	`Lucas(n)^2 - 4(-1)^n. G.f.: x(5-5x)/[(1+x)(1-3x+x^2)].`
	CROSSREFS	`Equals 5 * A007598(n).` `Adjacent sequences: A099918 A099919 A099920 this_sequence A099922 A099923 A099924` `Sequence in context: A028892 A039914 A094338 this_sequence A139470 A127513 A091260`
	KEYWORD	`nonn`
	AUTHOR	`Ralf Stephan, Nov 01 2004`

page 1

Search completed in 0.002 seconds

Last modified October 13 09:05 EDT 2008. Contains 145008 sequences.

AT&T Labs Research