The OEIS Foundation is supported by donations from users of the OEIS and by a grant from the Simons Foundation.

 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 A174624 Triangle read by rows: T(n,k) = prime(n) mod 2^Omega(k), where Omega() is the number of prime divisors (counted with multiplicity). 2
 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, 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, 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 (list; table; graph; refs; listen; history; text; internal format)
 OFFSET 1,10 LINKS Harvey P. Dale, Table of n, a(n) for n = 1..1000 EXAMPLE Triangle begins:   0;   0, 1;   0, 1, 1;   0, 1, 1, 3;   0, 1, 1, 3, 1;   0, 1, 1, 1, 1, 1; MAPLE A174624 := proc(n, k) ithprime(n) mod (2^numtheory[bigomega](k)) ; end proc: seq(seq(A174624(n, k), k=1..n), n=1..15) ; # R. J. Mathar, Nov 30 2010 MATHEMATICA Table[Mod[Prime[n], 2^PrimeOmega[k]], {n, 20}, {k, n}]//Flatten (* Harvey P. Dale, Jun 02 2016 *) CROSSREFS Cf. A001222. Sequence in context: A091614 A249767 A174433 * A029358 A088512 A094921 Adjacent sequences:  A174621 A174622 A174623 * A174625 A174626 A174627 KEYWORD nonn,tabl AUTHOR Juri-Stepan Gerasimov, Nov 29 2010 STATUS approved

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recent
The OEIS Community | Maintained by The OEIS Foundation Inc.

Last modified October 31 05:06 EDT 2020. Contains 338098 sequences. (Running on oeis4.)