A094150 - OEIS

This site is supported by donations to The OEIS Foundation.

A094150

Number of iterations of the sum of digits of the divisors of R(n) needed to reach 15, where R(n) = A002275.

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

	OFFSET	`2,1`
	EXAMPLE	`a(9)=3 because 111111111 -> 151 -> 8 -> 15.` `a(1) does not exist because 1 -> 1 and never reaches 15.`
	CROSSREFS	`Cf. A034690, A086793.` `Sequence in context: A156682 A089534 A116981 * A130502 A051899 A085956` `Adjacent sequences: A094147 A094148 A094149 * A094151 A094152 A094153`
	KEYWORD	`less,nonn,base`
	AUTHOR	`Jason Earls (zevi_35711(AT)yahoo.com), Jun 01 2004`
	EXTENSIONS	`More terms from David Wasserman (dwasserm(AT)earthlink.net), May 22 2007`

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

Last modified February 14 23:53 EST 2012. Contains 205689 sequences.