|
%I #13 Sep 01 2023 20:17:15
%S 0,0,1,0,1,1,0,1,1,3,0,1,1,3,1,0,1,1,1,1,1,0,1,1,1,1,1,1,0,1,1,3,1,3,
%T 1,3,0,1,1,3,1,3,1,7,3,0,1,1,1,1,1,1,5,1,1,0,1,1,3,1,3,1,7,3,3,1,0,1,
%U 1,1,1,1,1,5,1,1,1,5,0,1,1,1,1,1,1,1,1,1,1,1,1,0,1,1,3,1,3,1,3,3,3,1,3,1,3,0,1,1,3,1,3,1,7,3,3,1,7,1,3,3
%N Triangle read by rows: T(n,k) = prime(n) mod 2^Omega(k), where Omega() is the number of prime divisors (counted with multiplicity).
%H Harvey P. Dale, <a href="/A174624/b174624.txt">Table of n, a(n) for n = 1..1000</a>
%e Triangle begins:
%e 0;
%e 0, 1;
%e 0, 1, 1;
%e 0, 1, 1, 3;
%e 0, 1, 1, 3, 1;
%e 0, 1, 1, 1, 1, 1;
%p A174624 := proc(n,k) ithprime(n) mod (2^numtheory[bigomega](k)) ; end proc:
%p seq(seq(A174624(n,k),k=1..n),n=1..15) ; # _R. J. Mathar_, Nov 30 2010
%t Table[Mod[Prime[n],2^PrimeOmega[k]],{n,20},{k,n}]//Flatten (* _Harvey P. Dale_, Jun 02 2016 *)
%Y Cf. A001222, A174793.
%K nonn,tabl
%O 1,10
%A _Juri-Stepan Gerasimov_, Nov 29 2010
|
