id:A108561 - OEIS Search Results

Search: id:A108561

Displaying 1-1 of 1 results found.

page 1

Triangle read by rows: T(n,0)=1, T(n,n)=(-1)^floor(n/2), T(n+1,k)=T(n,k-1)+T(n,k) for 0<k<n.

+0
13

1, 1, -1, 1, 0, 1, 1, 1, 1, -1, 1, 2, 2, 0, 1, 1, 3, 4, 2, 1, -1, 1, 4, 7, 6, 3, 0, 1, 1, 5, 11, 13, 9, 3, 1, -1, 1, 6, 16, 24, 22, 12, 4, 0, 1, 1, 7, 22, 40, 46, 34, 16, 4, 1, -1, 1, 8, 29, 62, 86, 80, 50, 20, 5, 0, 1, 1, 9, 37, 91, 148, 166, 130, 70, 25, 5, 1, -1, 1, 10, 46, 128, 239, 314, 296, 200, 95, 30, 6, 0, 1, 1, 11, 56, 174, 367 (list; table; graph; listen)

	OFFSET	`0,12`
	COMMENT	`Sum(T(n,k): 0<=k<=n) = A078008(n);` `Sum(abs(T(n,k)): 0<=k<=n) = A052953(n-1) for n>0;` `T(n,1) = n - 2 for n>1;` `T(n,2) = A000124(n-3) for n>2;` `T(n,3) = A003600(n-4) for n>4;` `T(n,n-6) = A001753(n-6) for n>6;` `T(n,n-5) = A001752(n-5) for n>5;` `T(n,n-4) = A002623(n-4) for n>4;` `T(n,n-3) = A002620(n-1) for n>3;` `T(n,n-2) = A008619(n-2) for n>2;` `T(n,n-1) = n mod 2 for n>0;` `T(2*n,n) = A072547(n+1).`
	LINKS	`Index entries for triangles and arrays related to Pascal's triangle`
	CROSSREFS	`Cf. A007318.` `Sequence in context: A113414 A112185 A112555 this_sequence A104579 A079531 A134178` `Adjacent sequences: A108558 A108559 A108560 this_sequence A108562 A108563 A108564`
	KEYWORD	`sign,tabl`
	AUTHOR	`Reinhard Zumkeller (reinhard.zumkeller(AT)lhsystems.com), Jun 10 2005`

page 1

Search completed in 0.002 seconds

Last modified July 23 17:35 EDT 2008. Contains 142285 sequences.

AT&T Labs Research