id:A081574 - OEIS Search Results

Search: id:A081574

Displaying 1-1 of 1 results found.

page 1

Fourth binomial transform of Fibonacci numbers F(n).

+0
4

0, 1, 9, 62, 387, 2305, 13392, 76733, 436149, 2467414, 13919895, 78398189, 441105696, 2480385673, 13942462833, 78354837710, 440286745563, 2473838793577, 13899100976496, 78088971710501, 438717826841085 (list; graph; listen)

	OFFSET	`0,3`
	COMMENT	`Binomial transform of A081573. Case k=4 of family of recurrences a(n)=(2k+1)a(n-1)-A028387(k-1)a(n-2),a(0)=0,a(1)=1.`
	FORMULA	`a(n)=9a(n-1)-19a(n-1), a(0)=0, a(1)=1. a(n)=((sqrt(5)/2+9/2)^n-(9/2-sqrt(5)/2)^n)/sqrt(5). G.f.: 1/(1-9x+19x^2).`
	CROSSREFS	`Cf. A000045, A081569.` `Sequence in context: A075139 A098921 A027234 this_sequence A084151 A085645 A015669` `Adjacent sequences: A081571 A081572 A081573 this_sequence A081575 A081576 A081577`
	KEYWORD	`easy,nonn`
	AUTHOR	`Paul Barry (pbarry(AT)wit.ie), Mar 22 2003`

page 1

Search completed in 0.002 seconds

Last modified July 26 13:41 EDT 2008. Contains 142293 sequences.

AT&T Labs Research