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 A083898 #11 Jan 04 2024 01:48:23
%S A083898 1,2,2,2,1,3,1,2,2,3,2,4,2,2,2,2,1,3,1,4,3,4,2,4,1,3,2,2,1,5,2,3,4,2,
%T A083898 1,4,1,2,3,4,1,4,1,4,2,3,1,4,1,3,2,3,1,3,2,2,2,2,1,7,1,3,3,3,2,6,1,2,
%U A083898 3,3,1,4,1,2,2,2,2,4,1,4,2,2,1,5,1,2,2,4,1,5,2,3,3,2,1,5,1,2,4,5,2,4,2,3,3
%N A083898 Number of divisors of n with largest digit <= 3 (base 10).
%H A083898 Harvey P. Dale, <a href="/A083898/b083898.txt">Table of n, a(n) for n = 1..1000</a>
%F A083898 a(n) = A083897(n) + A083890(n) = A083899(n) - A083891(n).
%F A083898 Asymptotic mean: Limit_{m->oo} (1/m) * Sum_{k=1..m} a(k) = Sum_{k>=1} 1/A007090(k) = 2.93694402167748963905... . - _Amiram Eldar_, Jan 04 2024
%t A083898 Table[Count[Divisors[n],_?(Total[Most[Drop[DigitCount[#],3]]]==0&)],{n,120}] (* _Harvey P. Dale_, Dec 21 2018 *)
%Y A083898 Cf. A054055, A000005, A007090, A083890, A083891, A083897, A083899.
%K A083898 nonn,base
%O A083898 1,2
%A A083898 _Reinhard Zumkeller_, May 08 2003