%I #12 Feb 01 2024 04:20:20
%S 1,0,1,1,0,1,0,0,0,1,1,0,0,0,1,0,1,0,0,0,1,1,0,0,0,0,0,1,0,0,0,0,0,0,
%T 0,1,1,0,1,0,0,0,0,0,1,0,1,0,0,0,0,0,0,0,1,1,0,0,0,0,0,0,0,0,0,1,0,0,
%U 0,1,0,0,0,0,0,0,0,1,1,0,0,0,0,0,0,0,0,0,0,0,1
%N Triangle read by rows: T(n,k) = 1 if k divides n and n/k is odd, T(n,k) = 0 otherwise.
%H Andrew Howroyd, <a href="/A129372/b129372.txt">Table of n, a(n) for n = 1..1275</a>
%F Equals A051731 * A115359.
%F Sum_{k=1..n} T(n, k) = A001227(n) (row sums).
%F From _G. C. Greubel_, Feb 01 2024: (Start)
%F Sum_{k=1..n} (-1)^(k-1)*T(n, k) = (-1)^(n-1)*A001227(n).
%F Sum_{k=1..floor((n+1)/2)} T(n-k+1, k) = A183063(n+1). (End)
%e First few rows of the triangle:
%e 1;
%e 0, 1;
%e 1, 0, 1;
%e 0, 0, 0, 1;
%e 1, 0, 0, 0, 1;
%e 0, 1, 0, 0, 0, 1;
%e 1, 0, 0, 0, 0, 0, 1;
%e 0, 0, 0, 0, 0, 0, 0, 1;
%e 1, 0, 1, 0, 0, 0, 0, 0, 1;
%e ...
%t A129372[n_, k_]:= If[Mod[n,k]==0 && OddQ[n/k], 1, 0];
%t Table[A129372[n, k], {n,15}, {k,n}]//Flatten (* _G. C. Greubel_, Feb 01 2024 *)
%o (PARI) T(n,k)=if(n%k, 0, n/k%2==1) \\ _Andrew Howroyd_, Aug 10 2018
%o (Magma)
%o A129372:= func< n,k | (n mod k) eq 0 and (Floor(n/k) mod 2) eq 1 select 1 else 0 >;
%o [A129372(n,k): k in [1..n], n in [1..15]]; // _G. C. Greubel_, Feb 01 2024
%o (SageMath)
%o def A129372(n,k): return 1 if (n%k)==0 and ((n/k)%2)==1 else 0
%o flatten([[A129372(n,k) for k in range(1,n+1)] for n in range(1,16)]) # _G. C. Greubel_, Feb 01 2024
%Y Cf. A051731, A115359, A183063.
%Y Cf. A001227 (row sums).
%K nonn,tabl
%O 1,1
%A _Gary W. Adamson_, Apr 11 2007
%E Name changed and terms a(56) and beyond from _Andrew Howroyd_, Aug 10 2018