This is a front-end for the Online Encyclopedia of Integer Sequences, made by Christian Perfect. The idea is to provide OEIS entries in non-ancient HTML, and then to think about how they're presented visually. The source code is on GitHub.
%I A382897 #14 Jul 17 2025 09:04:01 %S A382897 1,2,3,4,5,6,7,8,9,1,1,2,1,1,5,1,1,1,1,2,1,2,1,8,5,2,1,2,1,3,1,2,3,1, %T A382897 5,18,1,1,3,4,1,2,1,4,5,1,1,4,1,5,1,2,1,1,5,1,1,1,1,6,1,2,3,4,5,6,1,1, %U A382897 1,7,1,2,1,1,5,1,7,1,1,8,1,2,1,4,5,1,1,8,1,9,1,2,3,1,5,6,1,1,9 %N A382897 a(n) = n / A382895(n). %H A382897 Seiichi Manyama, <a href="/A382897/b382897.txt">Table of n, a(n) for n = 1..10000</a> %o A382897 (Ruby) %o A382897 def A(n) %o A382897 m = n %o A382897 n.to_s.split('').map(&:to_i).each{|i| %o A382897 m /= i if i != 0 && m % i == 0 %o A382897 } %o A382897 n / m %o A382897 end %o A382897 def A382897(n) %o A382897 (1..n).map{|i| A(i)} %o A382897 end %o A382897 p A382897(100) %o A382897 (Python) %o A382897 def A(n): %o A382897 m = n %o A382897 for i in map(int, str(n)): %o A382897 if i != 0 and m % i == 0: %o A382897 m //= i %o A382897 return n // m %o A382897 def A382897(n): %o A382897 return [A(i) for i in range(1, n + 1)] %o A382897 print(A382897(100)) %Y A382897 Cf. A051801, A382895. %K A382897 nonn,base,easy %O A382897 1,2 %A A382897 _Seiichi Manyama_, Apr 08 2025