|
Search: id:A049061
|
|
|
| A049061 |
|
Triangle a(n,k) (1<=k<=n) of "signed Eulerian numbers" read by rows. |
|
+0
5
|
|
| 1, 1, -1, 1, 0, -1, 1, -1, -1, 1, 1, 2, -6, 2, 1, 1, 1, -8, 8, -1, -1, 1, 8, -19, 0, 19, -8, -1, 1, 7, -27, 19, 19, -27, 7, 1, 1, 22, -32, -86, 190, -86, -32, 22, 1, 1, 21, -54, -54, 276, -276, 54, 54, -21, -1, 1, 52, 27, -648, 1002, 0, -1002, 648, -27, -52, -1, 1, 51, -25
(list; table; graph; listen)
|
|
|
OFFSET
|
1,12
|
|
|
COMMENT
|
Identical to rows n=2..n of D(n,k) on page 2 of Tanimoto reference. - Jonathan Vos Post (jvospost3(AT)gmail.com), Dec 11 2006
|
|
REFERENCES
|
Desarmenien, Jacques; Foata, Dominique; The signed Eulerian numbers. Discrete Math. 99 (1992), number 1-3, 49-58.
|
|
LINKS
|
J. Desarmenien and D. Foata, The signed Eulerian Numbers
Shinji Tanimoto, Parity-Alternate Permutations and Signed Eulerian Numbers, math.CO/0612135.
S. Tanimoto, A new approach to signed Eulerian numbers
|
|
FORMULA
|
a(2n, k)=a(2n-1, k)-a(2n-1, k-1), a(2n+1, k) = k*a(2n, k)+(2n-k+2)*a(2n, k-1).
|
|
EXAMPLE
|
1; 1,-1; 1,0,-1; 1,-1,-1,1; 1,2,-6,2,1; ...
|
|
CROSSREFS
|
Cd. A008292.
Sequence in context: A134301 A004544 A010590 this_sequence A082516 A008905 A136760
Adjacent sequences: A049058 A049059 A049060 this_sequence A049062 A049063 A049064
|
|
KEYWORD
|
sign,easy,tabl,nice
|
|
AUTHOR
|
N. J. A. Sloane (njas(AT)research.att.com).
|
|
EXTENSIONS
|
More terms from Larry Reeves (larryr(AT)acm.org), Apr 12 2000
ArXiv URL replaced by its non-cached version - R. J. Mathar (mathar(AT)strw.leidenuniv.nl), Oct 23 2009
|
|
|
Search completed in 0.002 seconds
|
