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 A083897 #9 Jan 04 2024 01:48:07
%S A083897 1,2,1,2,1,2,1,2,1,3,2,3,1,2,1,2,1,2,1,4,2,4,1,3,1,2,1,2,1,3,1,2,2,2,
%T A083897 1,3,1,2,1,4,1,3,1,4,1,2,1,3,1,3,1,2,1,2,2,2,1,2,1,5,1,2,2,2,1,4,1,2,
%U A083897 1,3,1,3,1,2,1,2,2,2,1,4,1,2,1,4,1,2,1,4,1,3,1,2,1,2,1,3,1,2,2,5,2,3,1,2,2
%N A083897 Number of divisors of n with largest digit <= 2 (base 10).
%F A083897 a(n) = A083888(n) + A083889(n) = A083898(n) - A083890(n).
%F A083897 Asymptotic mean: Limit_{m->oo} (1/m) * Sum_{k=1..m} a(k) = Sum_{k>=1} 1/A007089(k) = 2.09476944442950059256... . - _Amiram Eldar_, Jan 04 2024
%t A083897 Table[Count[Divisors[n],_?(Max[IntegerDigits[#]]<3&)],{n,110}] (* _Harvey P. Dale_, May 24 2019 *)
%Y A083897 Cf. A054055, A000005, A083888, A083889, A083898, A083890, A007089.
%K A083897 nonn,base
%O A083897 1,2
%A A083897 _Reinhard Zumkeller_, May 08 2003