A036430 - OEIS

This site is supported by donations to The OEIS Foundation.

A036430

Let b(0)=n, b(i)=# of prime factors of b(i-1); then a(n)=i such that b(i)=1.

0, 1, 1, 2, 1, 2, 1, 2, 2, 2, 1, 2, 1, 2, 2, 3, 1, 2, 1, 2, 2, 2, 1, 3, 2, 2, 2, 2, 1, 2, 1, 2, 2, 2, 2, 3, 1, 2, 2, 3, 1, 2, 1, 2, 2, 2, 1, 2, 2, 2, 2, 2, 1, 3, 2, 3, 2, 2, 1, 3, 1, 2, 2, 3, 2, 2, 1, 2, 2, 2, 1, 2, 1, 2, 2, 2, 2, 2, 1, 2, 3, 2, 1, 3, 2, 2, 2, 3, 1, 3, 2, 2, 2, 2, 2, 3, 1, 2, 2, 3, 1, 2, 1, 3, 2 (list; graph; refs; listen; history; internal format)

	OFFSET	`1,4`
	FORMULA	`a(n)=1+a(bigomega(n)). - Vladeta Jovovic (vladeta(AT)eunet.rs), Jul 10 2004`
	EXAMPLE	`Let b(0) = 16, then b(1) = 4 and b(2) = 2, then b(3) = 1, hence a(16)=3.`
	CROSSREFS	`Cf. A029908, A073855.` `Sequence in context: A072491 A051034 A082477 * A163377 A163109 A128428` `Adjacent sequences: A036427 A036428 A036429 * A036431 A036432 A036433`
	KEYWORD	`nonn,easy`
	AUTHOR	`Dann Toliver (fsdrt(AT)hotmail.com)`
	EXTENSIONS	`Corrected and extended by Antonio G. Astudillo (afg_astudillo(AT)lycos.com), Apr 21 2003`

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

Last modified February 16 08:13 EST 2012. Contains 205893 sequences.