id:A133416 - OEIS Search Results

Search: id:A133416

Displaying 1-1 of 1 results found.

page 1

(1/10)*(2^(4*n-3)-5^n*F(2*n-1)+L(4*n-2)), where F() = Fibonacci numbers A000045 and L() = Lucas numbers A000032.

+0
1

0, 0, 1, 91, 3060, 74613, 1562275, 30045016, 548354601, 9669627915, 166514967388, 2819214031645, 47139484522131, 780855182286336, 12842348655153745, 210042772449096763, 3420451064885308740, 55509625058510689221, 898396209147305575171, 14508414020570344661800 (list; graph; listen)

	OFFSET	`1,4`
	REFERENCES	`P. S. Bruckman, Problem H-650, Fib. Quart., 45 (2007), 91.`
	FORMULA	`Equals Sum_{k = 0..floor((n-3)/5)} binomial(4n-2, 2n-10k-6).`
	CROSSREFS	`Sequence in context: A118706 A119150 A008394 this_sequence A047697 A096054 A129965` `Adjacent sequences: A133413 A133414 A133415 this_sequence A133417 A133418 A133419`
	KEYWORD	`nonn`
	AUTHOR	`N. J. A. Sloane (njas(AT)research.att.com), Nov 27 2007`

page 1

Search completed in 0.002 seconds

Last modified November 27 22:38 EST 2009. Contains 167602 sequences.

AT&T Labs Research