id:A094435 - OEIS Search Results

Search: id:A094435

Displaying 1-1 of 1 results found.

page 1

Triangular array read by rows: T(n,k)=F(k)C(n,k), k=1,2,3,...,n; n>=1.

+0
5

1, 2, 1, 3, 3, 2, 4, 6, 8, 3, 5, 10, 20, 15, 5, 6, 15, 40, 45, 30, 8, 7, 21, 70, 105, 105, 56, 13, 8, 28, 112, 210, 280, 224, 104, 21, 9, 36, 168, 378, 630, 672, 468, 189, 34, 10, 45, 240, 630, 1260, 1680, 1560, 945, 340, 55, 11, 55, 330, 990, 2310, 3696, 4290, 3465, 1870 (list; table; graph; listen)

	OFFSET	`1,2`
	COMMENT	`Let F(n) denote the n-th Fibonacci number (A000045). Then n-th row sum of T is F(2n) and n-th alternating row sum is F(n).`
	EXAMPLE	`First four rows:` `1` `2 1` `3 3 2` `4 6 8 3 sum = 4+6+8+3=21=F(8); alt.sum = 4-6+8-3=3=F(4).` `T(4,3)=F(3)C(4,3)=2*4=8.`
	CROSSREFS	`Cf. A094441, A000045.` `Sequence in context: A032434 A002347 A006642 this_sequence A133341 A111492 A138635` `Adjacent sequences: A094432 A094433 A094434 this_sequence A094436 A094437 A094438`
	KEYWORD	`nonn,tabl`
	AUTHOR	`Clark Kimberling (ck6(AT)evansville.edu), May 03 2004`

page 1

Search completed in 0.002 seconds

Last modified August 19 23:53 EDT 2008. Contains 142930 sequences.

AT&T Labs Research