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 A328402 #11 Oct 18 2019 11:28:59
%S A328402 1,3,17,130,1517,20013,346902,6634497,154067794
%N A328402 Number of terms of A048103 found in range A002110(n-1) .. A002110(n)-1.
%C A328402 Number of integers from A002110(n-1) to A002110(n)-1 that are in range of A276086.
%C A328402 a(n) is the total number of times n occurs in A328404.
%F A328402 a(n) <= A061720(n-1) for all n >= 1.
%t A328402 With[{s = FoldList[Times, 1, Prime@ Range@ 7]}, Array[Boole[# == 2] + Count[Range[s[[# - 1]], s[[#]] - 1], _?(Times @@ Boole@ Map[First@ # > Last@ # &, FactorInteger@ #] > 0 &)] &, Length@ s - 1, 2]] (* _Michael De Vlieger_, Oct 17 2019 *)
%o A328402 (PARI)
%o A328402 A002110(n) = prod(i=1,n,prime(i));
%o A328402 isA048103(n) = { my(f = factor(n)); for(k=1, #f~, if(f[k, 2]>=f[k, 1], return(0))); (1); };
%o A328402 A328402(n) = sum(k=A002110(n-1),A002110(n)-1,isA048103(k));
%Y A328402 Cf. A002110, A048103, A061720, A129251, A276086, A328404.
%K A328402 nonn,more
%O A328402 1,2
%A A328402 _Antti Karttunen_, Oct 17 2019