A055396 - OEIS

This site is supported by donations to The OEIS Foundation.

A055396

Smallest prime dividing n is a(n)-th prime (a(1)=0).

0, 1, 2, 1, 3, 1, 4, 1, 2, 1, 5, 1, 6, 1, 2, 1, 7, 1, 8, 1, 2, 1, 9, 1, 3, 1, 2, 1, 10, 1, 11, 1, 2, 1, 3, 1, 12, 1, 2, 1, 13, 1, 14, 1, 2, 1, 15, 1, 4, 1, 2, 1, 16, 1, 3, 1, 2, 1, 17, 1, 18, 1, 2, 1, 3, 1, 19, 1, 2, 1, 20, 1, 21, 1, 2, 1, 4, 1, 22, 1, 2, 1, 23, 1, 3, 1, 2, 1, 24, 1, 4, 1, 2, 1, 3, 1 (list; graph; refs; listen; history; internal format)

	OFFSET	`1,3`
	COMMENTS	`A000040(a(n)) = A020639(n); a(n) <= A061395(n). - Reinhard Zumkeller (reinhard.zumkeller(AT)gmail.com), May 22 2003`
	LINKS	`Index entries for sequences generated by sieves`
	FORMULA	`a(n) = A049084(A020639(n)). - Reinhard Zumkeller (reinhard.zumkeller(AT)gmail.com), May 22 2003`
	EXAMPLE	`a(15)=2 because 15=3*5, 3<5 and 3 is the 2nd prime`
	CROSSREFS	`Cf. sieve of Eratosthenes: A004280, A038179, A055399.` `Sequence in context: A087267 A128267 A028920 * A057499 A064839 A094741` `Adjacent sequences: A055393 A055394 A055395 * A055397 A055398 A055399`
	KEYWORD	`nonn`
	AUTHOR	`Henry Bottomley (se16(AT)btinternet.com), May 15 2000`

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

Last modified February 17 13:18 EST 2012. Contains 206031 sequences.