|
%I #20 Sep 01 2023 20:17:48
%S 0,0,0,0,1,1,0,0,0,0,0,1,1,1,1,0,0,0,2,0,2,0,1,1,3,1,3,1,0,0,0,0,0,0,
%T 0,0,0,1,1,1,1,1,1,1,1,0,0,0,2,0,2,0,2,2,2,0,1,1,3,1,3,1,3,3,3,1,0,0,
%U 0,0,0,0,0,4,0,0,0,4,0,1,1,1,1,1,1,5,1,1,1,5,1,0,0,0,2,0,2,0,6,2,2,0,6,0,2
%N Triangle read by rows: R(n,k) = n mod 2^Omega(k), where Omega( ) is number of prime divisors counted with multiplicity and 1 <= k <= n.
%e Triangle begins
%e 0;
%e 0, 0;
%e 0, 1, 1;
%e 0, 0, 0, 0;
%e 0, 1, 1, 1, 1;
%e 0, 0, 0, 2, 0, 2;
%t Omega[n_] := If[n<2, 0, Plus@@Transpose[FactorInteger[n]][[2]]]; Flatten[Table[Mod[n, 2^Omega[k]], {n, 15}, {k, n}]]
%Y Cf. A001222, A174624.
%K nonn,tabl
%O 1,19
%A _Juri-Stepan Gerasimov_, Nov 30 2010
|
