id:A094437 - OEIS Search Results

Search: id:A094437

Displaying 1-1 of 1 results found.

page 1

Triangular array T(n,k)=F(k+2)C(n,k), k=0,1,2,3,...,n; n>=0.

+0
3

1, 1, 2, 1, 4, 3, 1, 6, 9, 5, 1, 8, 18, 20, 8, 1, 10, 30, 50, 40, 13, 1, 12, 45, 100, 120, 78, 21, 1, 14, 63, 175, 280, 273, 147, 34, 1, 16, 84, 280, 560, 728, 588, 272, 55, 1, 18, 108, 420, 1008, 1638, 1764, 1224, 495, 89, 1, 20, 135, 600, 1680, 3276, 4410, 4080, 2475, 890 (list; table; graph; listen)

	OFFSET	`1,3`
	COMMENT	`Let F(n) denote the n-th Fibonacci number (A000045). Then n-th row sum of T is F(2n+2) and n-th alternating row sum is -F(n-2).`
	EXAMPLE	`First four rows:` `1` `1 2` `1 4 3` `1 6 9 5 sum = 1+6+9+5=21=F(8); alt.sum = 1-6+9-5=-1=-F(1).` `T(3,2)=F(4)C(3,2)=3*3=9.`
	CROSSREFS	`Cf. A094442, A000045.` `Sequence in context: A152060 A093190 A132191 this_sequence A053123 A107661 A126570` `Adjacent sequences: A094434 A094435 A094436 this_sequence A094438 A094439 A094440`
	KEYWORD	`nonn,tabl`
	AUTHOR	`Clark Kimberling (ck6(AT)evansville.edu), May 03 2004`

page 1

Search completed in 0.002 seconds

Last modified November 25 08:46 EST 2009. Contains 167481 sequences.

AT&T Labs Research