The On-Line Encyclopedia of Integer Sequences (OEIS)

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

A117325

Indices of primes in A117322 prime(n) modulo semiprime(n).
(history; published version)

#4 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

#3 by N. J. A. Sloane at Fri Feb 27 03:00:00 EST 2009

EXAMPLE

a(60) = 400 because semiprime(400) = 1355, prime(400) = 2741, and

KEYWORD

easy,nonn,new

#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

Indices of primes in A117322 prime(n) modulo semiprime(n).

DATA

1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 14, 16, 22, 25, 29, 33, 35, 50, 64, 73, 76, 82, 88, 100, 115, 120, 169, 174, 176, 188, 194, 202, 211, 214, 218, 249, 265, 325, 354, 363, 369, 370, 371, 372, 373, 374, 378, 379, 380, 384, 385, 386, 393, 394, 395, 396, 399, 400

OFFSET

1,2

FORMULA

n such that A117322(n) is prime. n such that A000040(n) modulo A001358(n) is in A000040.

EXAMPLE

a(60) = 400 because semiprime(400) = 1355, prime(400) = 2741, and

2741 == 31 mod 1355, where 31 is prime.

KEYWORD

easy,nonn

AUTHOR

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

STATUS

approved