A117323 - OEIS

This site is supported by donations to The OEIS Foundation.

A117323

Semiprime(n) modulo prime(n).

0, 0, 4, 3, 3, 2, 4, 3, 2, 26, 2, 34, 35, 1, 39, 46, 49, 51, 55, 57, 58, 62, 65 (list; graph; refs; listen; history; internal format)

	OFFSET	`1,3`
	COMMENTS	`After a(14), it is always true that prime(n) > semiprime(n), so that a(n) = semiprime(n).`
	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.`
	CROSSREFS	`Sequence in context: A196274 A073871 A120927 * A016502 A117691 A171627` `Adjacent sequences: A117320 A117321 A117322 * A117324 A117325 A117326`
	KEYWORD	`easy,nonn`
	AUTHOR	`Jonathan Vos Post (jvospost3(AT)gmail.com), Mar 08 2006`

Content is available under The OEIS End-User License Agreement .

Last modified February 15 21:56 EST 2012. Contains 205860 sequences.