id:A094436 - OEIS Search Results

Search: id:A094436

Displaying 1-1 of 1 results found.

page 1

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

+0
3

1, 1, 1, 1, 2, 2, 1, 3, 6, 3, 1, 4, 12, 12, 5, 1, 5, 20, 30, 25, 8, 1, 6, 30, 60, 75, 48, 13, 1, 7, 42, 105, 175, 168, 91, 21, 1, 8, 56, 168, 350, 448, 364, 168, 34, 1, 9, 72, 252, 630, 1008, 1092, 756, 306, 55, 1, 10, 90, 360, 1050, 2016, 2730, 2520, 1530, 550, 89, 1, 11, 110 (list; table; graph; listen)

	OFFSET	`1,5`
	COMMENT	`Let F(n) denote the n-th Fibonacci number (A000045). Then n-th row sum of T is F(2n+1) and n-th alternating row sum is F(n-1).`
	EXAMPLE	`First four rows:` `1` `1 1` `1 2 2` `1 3 6 3 sum = 1+3+6+3=13=F(7); alt.sum = 1-3+6-3=1=F(2).` `T(3,2)=F(3)C(3,2)=2*3=6.`
	CROSSREFS	`Cf. A094441, A000045.` `Sequence in context: A068956 A124842 A134399 this_sequence A094441 A107230 A159830` `Adjacent sequences: A094433 A094434 A094435 this_sequence A094437 A094438 A094439`
	KEYWORD	`nonn,tabl`
	AUTHOR	`Clark Kimberling (ck6(AT)evansville.edu), May 03 2004`

page 1

Search completed in 0.003 seconds

Last modified December 7 23:50 EST 2009. Contains 170430 sequences.

AT&T Labs Research