|
| |
|
|
A080462
|
|
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.
|
|
1
| |
|
|
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; refs; listen; history; internal format)
|
|
|
|
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.
Sequence in context: A104888 A108461 A026535 * A194823 A098396 A043532
Adjacent sequences: A080459 A080460 A080461 * A080463 A080464 A080465
|
|
|
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
|
| |
|
|
