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 A346952 #21 Sep 02 2021 09:13:43
%S A346952 1,3,37,398,4303,45765,480740,5005328,51770770,532790460,5461696481,
%T A346952 55814395421,568944166801,5787517297675
%N A346952 Number of positive integers with n digits that are the product of two integers ending with 3.
%C A346952 a(n) is the number of n-digit numbers in A346950.
%F A346952 a(n) < A052268(n).
%F A346952 Conjecture: Lim_{n->infinity} a(n)/a(n-1) = 10.
%t A346952 Table[{lo,hi}={10^(n-1),10^n};Length@Select[Union@Flatten@Table[a*b,{a,3,Floor[hi/3],10},{b,a,Floor[hi/a],10}],lo<#<hi&],{n,7}] (* _Giorgos Kalogeropoulos_, Aug 16 2021 *)
%o A346952 (Python)
%o A346952 def a(n):
%o A346952 lo, hi = 10**(n-1), 10**n
%o A346952 return len(set(a*b for a in range(3, hi//3+1, 10) for b in range(a, hi//a+1, 10) if lo <= a*b < hi))
%o A346952 print([a(n) for n in range(1, 9)]) # _Michael S. Branicky_, Aug 09 2021
%Y A346952 Cf. A017377, A052268, A346509 (ending with 1), A337855 (ending with 5), A337856 (ending with 6), A346950.
%K A346952 nonn,base,hard,more
%O A346952 1,2
%A A346952 _Stefano Spezia_, Aug 08 2021
%E A346952 a(6)-a(11) from _Michael S. Branicky_, Aug 09 2021
%E A346952 a(12)-a(14) from _Martin Ehrenstein_, Aug 22 2021