|
Search: id:A111519
|
|
|
| A111519 |
|
Sequence is {a(1,n)}, where a(m,n) is defined at sequence A111518. |
|
+0
6
|
|
| 1, 1, -2, -6, 1, 12, -50, -64, 517, -718, -4893, 27627, -20732, -464357, 2672305, -2162339, -62481580, 444310916, -765988257, -11093444366, 111888950896, -384937404033, -2094287782189, 37323429564497, -222553834299716, -59765515327025, 14271643579848985, -141966128047629231
(list; graph; listen)
|
|
|
OFFSET
|
0,3
|
|
|
LINKS
|
Leroy Quet, Home Page (listed in lieu of email address)
|
|
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
|
A111519T := 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 := A111519T(nmax) ; r := 1 ; 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. A111518, A111520, A111521, A111522, A111523.
Sequence in context: A100831 A136763 A109530 this_sequence A008855 A132181 A027642
Adjacent sequences: A111516 A111517 A111518 this_sequence A111520 A111521 A111522
|
|
KEYWORD
|
easy,sign
|
|
AUTHOR
|
Leroy Quet Aug 05 2005
|
|
EXTENSIONS
|
More terms from R. J. Mathar (mathar(AT)strw.leidenuniv.nl), Sep 26 2006
|
|
|
Search completed in 0.002 seconds
|
