A101183 Number of times (>0) function f must be applied in A100800 to arrive at multiple of n, or 0 if multiple of n is never reached.

1, 1, 1, 1, 1, 1, 1, 1, 1, 14, 32, 3, 12, 36, 3, 31, 10, 2, 71, 8, 8, 8, 11, 8, 67, 8, 3, 35, 35, 10, 31, 53, 22, 45, 38, 4, 59, 70, 44, 27, 27, 19, 44, 36, 5, 14, 47, 42, 33, 66, 16, 33, 42, 11, 105, 151, 5, 92, 69, 7, 7, 48, 6, 23, 20, 22, 7, 62, 22, 145, 7, 7, 20, 7, 58, 7, 184, 44

Offset: 1

Author

Ray Chandler, Dec 19 2004

Keywords

• base
• look
• nonn

Comments

Conjecture: No term is zero.

Examples

			a(10) = 14 since f has to be applied 14 times to 10 to arrive at 130, a multiple of 10.
		

Links

• Robert Israel, Table of n, a(n) for n = 1..10000

Crossrefs

Cf. A100800, A100801.

Programs

Maple

f:= n -> n + convert(convert(n,base,10),`+`):
g:= proc(n) local j,t;
  t:= n;
  for j from 1 do
    t:= f(t);
    if t mod n = 0 then return j fi
  od
end proc:
map(g, [$1..100]); # Robert Israel, May 14 2019