A014683 - OEIS

This site is supported by donations to The OEIS Foundation.

A014683

In the sequence of positive integers add 1 to each prime number.

1, 3, 4, 4, 6, 6, 8, 8, 9, 10, 12, 12, 14, 14, 15, 16, 18, 18, 20, 20, 21, 22, 24, 24, 25, 26, 27, 28, 30, 30, 32, 32, 33, 34, 35, 36, 38, 38, 39, 40, 42, 42, 44, 44, 45, 46, 48, 48, 49, 50, 51, 52, 54, 54, 55, 56, 57, 58, 60, 60, 62, 62, 63, 64, 65, 66, 68, 68, 69, 70, 72, 72 (list; graph; refs; listen; history; internal format)

	OFFSET	`1,2`
	COMMENTS	`For n >= 3, a(n) = smallest composite number m such that m - (n-2) is a prime. - Amarnath Murthy (amarnath_murthy(AT)yahoo.com) and Antonio G. Astudillo (afg_astudillo(AT)hotmail.com), Mar 08 2003.`
	LINKS	`N. J. A. Sloane, Table of n, a(n) for n = 1..10000`
	PROG	`(PARI) a(n)=n+isprime(n)`
	CROSSREFS	`Sequence in context: A059179 A061117 A111234 * A166737 A088847 A120613` `Adjacent sequences: A014680 A014681 A014682 * A014684 A014685 A014686`
	KEYWORD	`nonn,easy`
	AUTHOR	`Mohammad K. Azarian (ma3(AT)evansville.edu)`
	EXTENSIONS	`More terms from Erich Friedman (erich.friedman(AT)stetson.edu).`

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

Last modified February 17 23:08 EST 2012. Contains 206085 sequences.