%I #12 Jan 09 2024 16:39:40
%S 1,2,1,4,4,1,7,12,5,1,12,33,22,8,1,20,88,94,56,12,1,33,232,399,385,
%T 134,19,1,54,609,1691,2640,1487,342,30,1,88,1596,7164,18096,16492,
%U 6138,872,48,1,143,4180,30348,124033,182900,110143,25319,2256,77,1
%N Array: T(m,n) = (F(m) + F(2*m) + ... + F(n*m))/F(m), by antidiagonals, where F = A000045 (Fibonacci numbers).
%C col 1: A001612 (except for initial term)
%C row 1: A000071
%C row 2: A027941
%C row 3: A049652
%C row 4: A092521
%C row 6: A049664
%C row 8: A156093 without minus signs
%H Clark Kimberling, <a href="/A214984/b214984.txt">Antidiagonals n = 1..60, flattened</a>
%F For odd-numbered rows (m odd):
%F T(m,n) = (F(m*n+m) + F(m*n) - F(m))/(F(m)*L(m)).
%F For even-numbered rows (m even):
%F T(m,n) = (F(m*n+m) - F(m*n) - F(m))/(F(m)*(L(m)-2)).
%e Northwest corner:
%e 1...2....4.....7......12......20
%e 1...4....12....33.....88......232
%e 1...5....22....94.....399.....1691
%e 1...8....56....385....2640....18096
%e 1...12...134...1487...16492...182900
%t F[n_] := Fibonacci[n]; L[n_] := LucasL[n];
%t t[m_, n_] := (1/F[m])*Sum[F[m*k], {k, 1, n}]
%t TableForm[Table[t[m, n], {m, 1, 10}, {n, 1, 10}]]
%t Flatten[Table[t[k, n + 1 - k], {n, 1, 12}, {k, 1, n}]]
%Y Cf. A214978, A214985, A214986.
%K nonn,tabl
%O 1,2
%A _Clark Kimberling_, Oct 28 2012
|