|
%I #12 Feb 17 2017 18:26:47
%S 1,1,1,1,0,1,1,0,0,1,1,1,1,1,1,1,0,1,1,0,1,1,1,1,2,1,1,1,1,1,2,2,2,2,
%T 1,1,1,1,2,3,2,3,2,1,1,1,2,3,4,4,4,4,3,2,1,1,2,4,5,5,6,5,5,4,2,1
%N Triangle T(n,m) read by rows: T(n,m) = a(n) - a(m) - a(n-m) + 1, where a(n) = A000931(n+4).
%H Indranil Ghosh, <a href="/A176505/b176505.txt">Rows 0..120, flattened</a>
%H Indranil Ghosh, <a href="/A176505/a176505.txt">Python Program to generate the b-file</a>
%F T(n,m) = a(n) - a(m) - a(n-m) + 1, a(n) = A000931(n+4).
%e Triangle:
%e {1},
%e {1, 1},
%e {1, 0, 1},
%e {1, 0, 0, 1},
%e {1, 1, 1, 1, 1},
%e {1, 0, 1, 1, 0, 1},
%e {1, 1, 1, 2, 1, 1, 1},
%e {1, 1, 2, 2, 2, 2, 1, 1},
%e {1, 1, 2, 3, 2, 3, 2, 1, 1},
%e {1, 2, 3, 4, 4, 4, 4, 3, 2, 1},
%e {1, 2, 4, 5, 5, 6, 5, 5, 4, 2, 1},
%e ...
%e T(6,3) = a(6) - a(3) - a(6-3) + 1 = a(6) - 2 * a(3) + 1 = 3 - (2 * 1) + 1 = 2. - _Indranil Ghosh_, Feb 17 2017
%t a[0] := 0; a[1] := 1; a[2] := 1;
%t a[n_] := a[n] = a[n - 2] + a[n - 3];
%t t[n_, m_] := t[n, m] = a[n] - a[m] - a[n - m] + 1;
%t Table[Table[t[n, m], {m, 0, n}], {n, 0, 10}];
%t Flatten[%]
%Y Cf. A000931.
%K nonn,tabl,easy,less
%O 0,25
%A _Roger L. Bagula_, Apr 19 2010
%E Name and formula sections corrected by _Indranil Ghosh_, Feb 17 2017
|
