id:A080462 - OEIS Search Results

Search: id:A080462

Displaying 1-1 of 1 results found.

page 1

Define f(k) = Floor [ k/ sum of the digits of k]. Let f(f(...(n)))) = m where m is divisible by the sum of the digits of m. Then a(n)= one more than the least number of steps to obtain m.

+0
2

1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 2, 1, 2, 2, 2, 2, 2, 1, 2, 1, 1, 2, 2, 1, 2, 2, 1, 2, 2, 1, 2, 2, 2, 2, 2, 1, 2, 2, 2, 1, 2, 1, 2, 2, 1, 2, 2, 1, 2, 1, 2, 2, 2, 1, 2, 2, 2, 2, 2, 1, 2, 2, 1, 2, 2, 2, 2, 2, 2, 1, 2, 1, 2, 2, 2, 2, 2, 2, 2, 1, 1, 2, 2, 1, 2, 2, 2, 2, 2, 1, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1 (list; graph; listen)

	OFFSET	`1,11`
	EXAMPLE	`a(24) = 1 as 24 is divisible by 2+4. a(23) = 2, since f(23) = 4. a(14835)= 3 because f(14835) = 76, f(76) = 5, etc.`
	CROSSREFS	`Cf. A066578.` `Adjacent sequences: A080459 A080460 A080461 this_sequence A080463 A080464 A080465` `Sequence in context: A104888 A108461 A026535 this_sequence A098396 A043532 A043557`
	KEYWORD	`base,easy,nonn`
	AUTHOR	`Amarnath Murthy (amarnath_murthy(AT)yahoo.com), Mar 02 2003`
	EXTENSIONS	`More terms from Antonio G. Astudillo (afg_astudillo(AT)lycos.com), Apr 06 2003`

page 1

Search completed in 0.002 seconds

Last modified October 11 13:47 EDT 2008. Contains 144830 sequences.

AT&T Labs Research