login
This site is supported by donations to The OEIS Foundation.

 

Logo


Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A117323 Semiprime(n) modulo prime(n). 0

%I

%S 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,

%T 82,85,86,87,91,93,94,95,106,111,115,118,119,121,122,123,129,133,134,

%U 141,142,143,145,146,155,158,159,161,166,169,177,178,183,185,187

%N Semiprime(n) modulo prime(n).

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

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

%e a(1) = 4 mod 2 = 0.

%e a(2) = 6 mod 3 = 0

%e a(3) = 9 mod 5 = 4.

%e a(4) = 10 mod 7 = 3.

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

%K easy,nonn

%O 1,3

%A _Jonathan Vos Post_, Mar 08 2006

%E Corrected and extended by _Giovanni Resta_, Jun 15 2016

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.

License Agreements, Terms of Use, Privacy Policy. .

Last modified November 18 07:22 EST 2019. Contains 329252 sequences. (Running on oeis4.)