cp's OEIS Frontend

A382895 Divide n successively by its nonzero digits from most to least significant, updating the result at each step and skipping any digit that doesn't divide the current value exactly.

%I A382895 #19 Jul 17 2025 09:04:12
%S A382895 1,1,1,1,1,1,1,1,1,10,11,6,13,14,3,16,17,18,19,10,21,11,23,3,5,13,27,
%T A382895 14,29,10,31,16,11,34,7,2,37,38,13,10,41,21,43,11,9,46,47,12,49,10,51,
%U A382895 26,53,54,11,56,57,58,59,10,61,31,21,16,13,11,67,68,69,10,71,36,73,74,15
%N A382895 Divide n successively by its nonzero digits from most to least significant, updating the result at each step and skipping any digit that doesn't divide the current value exactly.
%H A382895 Seiichi Manyama, <a href="/A382895/b382895.txt">Table of n, a(n) for n = 1..10000</a>
%e A382895 36 is divisible by 3, so divide by 3 to get 12.
%e A382895 12 is divisible by 6, so divide by 6 to get  2. So a(36) = 2.
%o A382895 (Ruby)
%o A382895 def A(n)
%o A382895   m = n
%o A382895   n.to_s.split('').map(&:to_i).each{|i|
%o A382895     m /= i if i != 0 && m % i == 0
%o A382895   }
%o A382895   m
%o A382895 end
%o A382895 def A382895(n)
%o A382895   (1..n).map{|i| A(i)}
%o A382895 end
%o A382895 p A382895(100)
%o A382895 (Python)
%o A382895 def A(n):
%o A382895     m = n
%o A382895     for i in map(int, str(n)):
%o A382895         if i != 0 and m % i == 0:
%o A382895             m //= i
%o A382895     return m
%o A382895 def A382895(n):
%o A382895     return [A(i) for i in range(1, n + 1)]
%o A382895 print(A382895(100))
%Y A382895 Cf. A051801, A382897.
%K A382895 nonn,easy,base
%O A382895 1,10
%A A382895 _Seiichi Manyama_, Apr 08 2025