login

Year-end appeal: Please make a donation to the OEIS Foundation to support ongoing development and maintenance of the OEIS. We are now in our 61st year, we have over 378,000 sequences, and we’ve reached 11,000 citations (which often say “discovered thanks to the OEIS”).

A129705
Triangle T(n,m) = A000071(n+2)-m*(m+1)/2 read by rows.
1
0, 1, 0, 2, 1, -1, 4, 3, 1, -2, 7, 6, 4, 1, -3, 12, 11, 9, 6, 2, -3, 20, 19, 17, 14, 10, 5, -1, 33, 32, 30, 27, 23, 18, 12, 5, 54, 53, 51, 48, 44, 39, 33, 26, 18, 88, 87, 85, 82, 78, 73, 67, 60, 52, 43, 143, 142, 140, 137, 133, 128, 122, 115, 107, 98, 88
OFFSET
0,4
COMMENTS
The row sums are 0, 1, 2, 6, 15, 37, 84, 180, 366, 715, 1353, 2498, 4524 = (n+1)*(A000071(n+2) -(n+2)*n/6). - R. J. Mathar, Sep 09 2011
LINKS
Eric Weisstein's World of Mathematics, Schubert Variety
FORMULA
t(n,m) = sum_{i=0..n} A000045(i) - sum_{i=0..m} i, 0<=m<=n.
EXAMPLE
0;
1, 0;
2, 1, -1;
4, 3, 1, -2;
7, 6, 4, 1, -3;
12, 11, 9, 6, 2, -3;
20, 19, 17, 14, 10, 5, -1;
33, 32, 30, 27, 23, 18, 12, 5;
MAPLE
A000071 := proc(n) if n = 0 then 0; else combinat[fibonacci](n)-1 ; end if; end proc:
A129705 := proc(n, m) A000071(n+2)-m*(m+1)/2 ; end proc: # R. J. Mathar, Sep 09 2011
MATHEMATICA
fib[n_Integer?Positive] := fib[n] = fib[n - 1] + fib[n - 2]; fib[0] = 0; fib[1] = fib[2] = 1; t[n_, m_] = Sum[fib[i], {i, 0, n}] - Sum[i, {i, 0, m}]; Table[Table[t[n, m], {m, 0, n}], {n, 0, 10}]
CROSSREFS
Cf. A000045.
Sequence in context: A125790 A370005 A294082 * A302654 A264831 A264728
KEYWORD
tabl,easy,sign
AUTHOR
Roger L. Bagula, Jun 08 2007
STATUS
approved