STATUS
proposed
approved
The OEIS is supported by the many generous donors to the OEIS Foundation.
Revision History for A096078
(Bold, blue-underlined text is an addition; faded, red-underlined text is aShowing entries 1-10 | older changes
STATUS
editing
proposed
LINKS
Paul Barry, <a href="https://arxiv.org/abs/1803.06408">Three Études on a sequence transformation pipeline</a>, arXiv:1803.06408 [math.CO], 2018.
STATUS
approved
editing
STATUS
proposed
approved
STATUS
editing
proposed
AUTHOR
_Paul Boddington (psb(AT)maths.warwick.ac.uk), _, Jul 22 2004
STATUS
approved
editing
STATUS
editing
approved
NAME
Triangle read by rows: T(n,k) = (k+1)T(n-1,k) + (n-k+1)T(n,k-1).
MATHEMATICA
T[n_, 0] := 1; T[n_, 1] := 2^(n+1) - n - 2; T[n_, n_] := 2^(n+1)*(2^(2n+2) - 1)*Abs[ BernoulliB[2n + 2]]/ (n + 1); T[n_, k_] := (j + 1)T[n - 1, j] + (n - j + 1)T[n, j - 1]); Flatten[ Table[ T[n, k], {n, 0, 8}, {k, 0, n}]] (from * _Robert G. Wilson v _, Jul 23 2004 *)
STATUS
approved
editing
EXTENSIONS
Edited and extended by _Robert G. Wilson v (rgwv(AT)rgwv.com), _, Jul 23 2004
MATHEMATICA
T[n_, 0] := 1; T[n_, 1] := 2^(n+1) - n - 2; T[n_, n_] := 2^(n+1)*(2^(2n+2) - 1)*Abs[ BernoulliB[2n + 2]]/ (n + 1); T[n_, k_] := (j + 1)T[n - 1, j] + (n - j + 1)T[n, j - 1]); Flatten[ Table[ T[n, k], {n, 0, 8}, {k, 0, n}]] (from Robert G. Wilson v July Jul 23 2004)
KEYWORD
easy,nonn,tabl,new