A117323 Semiprime(n) modulo prime(n).

0, 0, 4, 3, 3, 2, 4, 3, 2, 26, 2, 34, 35, 38, 39, 46, 49, 51, 55, 57, 58, 62, 65, 69, 74, 77, 82, 85, 86, 87, 91, 93, 94, 95, 106, 111, 115, 118, 119, 121, 122, 123, 129, 133, 134, 141, 142, 143, 145, 146, 155, 158, 159, 161, 166, 169, 177, 178, 183, 185, 187

Offset

1,3

Comments

After a(14), it is always true that prime(n) > semiprime(n), so that a(n) = semiprime(n).

Links

Table of n, a(n) for n=1..61.

Formula

a(n) = A001358(n) modulo A000040(n).

Example

a(1) = 4 mod 2 = 0.
a(2) = 6 mod 3 = 0
a(3) = 9 mod 5 = 4.
a(4) = 10 mod 7 = 3.

Mathematica

sp = Select[Range[1000], PrimeOmega[#] == 2 &, 100]; Table[ Mod[sp[[i]], Prime[i]], {i, 100}] (* Giovanni Resta, Jun 15 2016 *)

Crossrefs

Sequence in context: A073871 A120927 A241180 * A016502 A305743 A117691

Adjacent sequences: A117320 A117321 A117322 * A117324 A117325 A117326

Keyword

easy,nonn

Author

Jonathan Vos Post, Mar 08 2006

Extensions

Corrected and extended by Giovanni Resta, Jun 15 2016

Status

approved