|
Search: id:A111518
|
|
|
| A111518 |
|
Sequence is {a(0,n)}, where a(m,0)=1, a(m,n) = a(m-1,n)+a(m,n-1) and a(0,n+1) is such that a(n+1,n+1) = a(0,n). |
|
+0
6
|
|
| 1, 0, -3, -4, 7, 11, -62, -14, 581, -1235, -4175, 32520, -48359, -443625, 3136662, -4834644, -60319241, 506792496, -1210299173, -10327456109, 122982395262, -496826354929, -1709350378156, 39417717346686, -259877263864213, 162788318972691, 14331409095176010
(list; graph; listen)
|
|
|
OFFSET
|
0,3
|
|
|
EXAMPLE
|
a(0,n): 1,0,-3,-4,7,...
a(1,n): 1,1,-2,-6,1,...
a(2,n): 1,2,0,-6,-5,...
a(3,n): 1,3,3,-3,-8,...
a(4,n): 1,4,7,4,-4,...
Main diagonal is 1,1,0,-3,-4,..., which is 1 followed by sequence a(0,n).
|
|
MAPLE
|
A111518T := proc(nmax) local a, m, n; a := array(0..nmax, 0..nmax) ; for m from 0 to nmax do a[m, 0] := 1 ; od ; for n from 1 to nmax do a[n, n] := a[0, n-1] ; for m from n+1 to nmax do a[m, n] := a[m-1, n]+a[m, n-1] ; od ; for m from n-1 to 0 by -1 do a[m, n] := a[m+1, n]-a[m+1, n-1] ; od ; od ; RETURN(a) ; end: nmax := 50 ; a := A111518T(nmax) ; r := 0 ; for n from 0 to nmax do printf("%d, ", a[r, n]) ; od; - R. J. Mathar (mathar(AT)strw.leidenuniv.nl), Sep 26 2006
|
|
CROSSREFS
|
Cf. A111519, A111520, A111521, A111522, A111523.
Sequence in context: A041631 A042655 A041901 this_sequence A041153 A041781 A042893
Adjacent sequences: A111515 A111516 A111517 this_sequence A111519 A111520 A111521
|
|
KEYWORD
|
easy,sign
|
|
AUTHOR
|
Leroy Quet (qq-quet(AT)mindspring.com), Aug 05 2005
|
|
EXTENSIONS
|
More terms from R. J. Mathar (mathar(AT)strw.leidenuniv.nl), Sep 26 2006
|
|
|
Search completed in 0.002 seconds
|
