A053670 - OEIS

This site is supported by donations to The OEIS Foundation.

A053670

Least number coprime to n and n+1.

3, 5, 5, 3, 7, 5, 3, 5, 7, 3, 5, 5, 3, 11, 7, 3, 5, 5, 3, 11, 5, 3, 5, 7, 3, 5, 5, 3, 7, 7, 3, 5, 5, 3, 11, 5, 3, 5, 7, 3, 5, 5, 3, 7, 7, 3, 5, 5, 3, 7, 5, 3, 5, 7, 3, 5, 5, 3, 7, 7, 3, 5, 5, 3, 7, 5, 3, 5, 11, 3, 5, 5, 3, 7, 7, 3, 5, 5, 3, 7, 5, 3, 5, 11, 3, 5, 5, 3, 7, 11, 3, 5, 5, 3, 7, 5, 3, 5, 7, 3, 5 (list; graph; refs; listen; history; internal format)

	OFFSET	`1,1`
	COMMENTS	`A179675(n) = smallest m such that a(m) = n-th odd prime. [From Reinhard Zumkeller (reinhard.zumkeller(AT)gmail.com), Jul 23 2010]`
	LINKS	`R. Zumkeller, Table of n, a(n) for n = 1..10000 [From Reinhard Zumkeller (reinhard.zumkeller(AT)gmail.com), Jul 23 2010]`
	CROSSREFS	`Cf. A053669-A053674.` `Sequence in context: A141334 A199614 A129488 * A085963 A184593 A189202` `Adjacent sequences: A053667 A053668 A053669 * A053671 A053672 A053673`
	KEYWORD	`nonn,nice,easy`
	AUTHOR	`Henry Bottomley (se16(AT)btinternet.com), Feb 15 2000`
	EXTENSIONS	`More terms from Andrew Gacek (andrew(AT)dgi.net), Feb 21 2000 and James A. Sellers (sellersj(AT)math.psu.edu), Feb 22 2000.`

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

Last modified February 16 20:09 EST 2012. Contains 205958 sequences.