The On-Line Encyclopedia of Integer Sequences (OEIS)

Revision History for A117324 (Bold, blue-underlined text is an addition; faded, red-underlined text is a ~~deletion~~.)
Showing all changes.

Prime(10^n) modulo semiprime(10^n).
(history; published version)

#5 by R. J. Mathar at Wed Mar 06 14:14:11 EST 2013

STATUS

editing

approved

#4 by R. J. Mathar at Wed Mar 06 14:14:04 EST 2013

COMMENTS

a(12) by "zak seidov" (zakseidov(AT)yahoo.com)

EXTENSIONS

a(12) from Zak Seidov

STATUS

approved

editing

#3 by Russ Cox at Fri Mar 30 18:40:36 EDT 2012

AUTHOR

_Jonathan Vos Post (jvospost3(AT)gmail.com), _, Mar 08 2006

Discussion

Fri Mar 30

18:40

OEIS Server: https://oeis.org/edit/global/228

#2 by N. J. A. Sloane at Fri Jan 09 03:00:00 EST 2009

KEYWORD

easy,nonn,new

AUTHOR

Jonathan Vos Post (jvospost2jvospost3(AT)yahoogmail.com), Mar 08 2006

#1 by N. J. A. Sloane at Fri Feb 24 03:00:00 EST 2006

NAME

Prime(10^n) modulo semiprime(10^n).

DATA

2, 3, 227, 729, 22965, 380555, 156346, 10920166, 202913258, 2973399074, 39284376410, 489544827463, 5874954672992

OFFSET

0,1

COMMENTS

a(12) by "zak seidov" (zakseidov(AT)yahoo.com)

FORMULA

a(n) = A000040(10^n) modulo A001358(10^n). a(n) = A117322(10^n). a(n) = A006988(n) modulo A114125(n).

EXAMPLE

prime(10^0) modulo semiprime(10^0) = 2 mod 4 = 2.

prime(10^1) modulo semiprime(10^1) = 29 mod 26 = 3.

prime(10^2) modulo semiprime(10^2) = 541 mod 314 = 227.

KEYWORD

easy,nonn

AUTHOR

Jonathan Vos Post (jvospost2(AT)yahoo.com), Mar 08 2006

STATUS

approved