|
%I #21 Feb 18 2022 22:33:24
%S 1,1,1,1,1,1,1,4,1,1,1,4,7,1,1,1,7,7,10,1,1,1,7,16,10,13,1,1,1,10,16,
%T 28,13,16,1,1,1,10,28,28,43,16,19,1,1,1,13,28,58,43,61,19,22,1,1,1,13,
%U 43,58,103,61,82,22,25,1,1,1,16,43,103,103,166,82
%N Regular triangle read by rows: T(n,k) = 3*binomial(floor((n+k)/2),k)-2.
%C Row sums = A131300: (1, 2, 3, 7, 14, 27, 49, 86, ...). Reversed triangle = A131299.
%H Nathaniel Johnston, <a href="/A131301/b131301.txt">Rows 0..100, flattened</a>
%F 3*A046854 - 2*A000012 as infinite lower triangular matrices (former name).
%F T(n,k) = 3*binomial(floor((n+k)/2),k)-2. - _Nathaniel Johnston_, Jun 29 2011
%e First few rows of the triangle:
%e 1;
%e 1, 1;
%e 1, 1, 1;
%e 1, 4, 1, 1;
%e 1, 4, 7, 1, 1;
%e 1, 7, 7, 10, 1, 1;
%e 1, 7, 16, 10, 13, 1, 1;
%e ...
%p for n from 0 to 6 do seq(3*binomial(floor((n+k)/2),k)-2,k=0..n); od; # _Nathaniel Johnston_, Jun 29 2011
%t t[n_, k_] := 3 Binomial[Floor[(n + k)/2], k] - 2; Table[t[n, k], {n, 11}, {k, 0, n}] // Flatten
%t (* to view triangle: Table[t[n, k], {n, 5}, {k, 0, n}] // TableForm *) (* _Robert G. Wilson v_, Feb 28 2015 *)
%Y Cf. A046854, A000012, A131299, A131300.
%K nonn,easy,tabl
%O 0,8
%A _Gary W. Adamson_, Jun 27 2007
|
