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 A354951 #10 Jun 14 2022 14:11:12
%S A354951 0,0,1,3,5,13,27,59,125,257,534,1094,2244,4607,9407,19164,38939,79154,
%T A354951 160473,325213,658940,1332598,2694009,5440236,10973874,22135366,
%U A354951 44644593,89989907,181374472,365371286,734959945
%N A354951 The number of squarefree abundant numbers whose largest prime divisor is prime(n).
%C A354951 For n >= 3 we have a(n) >= 2^(n-3) as all squarefree numbers whose largest prime divisor are prime(n) that are a multiple of 6*prime(n) are abundant. - _David A. Corneth_, Jun 13 2022
%e A354951 n prime(n) a(n) terms k of A087248 with A006530(k) = prime(n)
%e A354951 - -------- ---- ---------------------------------------------
%e A354951 1 2 0 -
%e A354951 2 3 0 -
%e A354951 3 5 1 30
%e A354951 4 7 3 42, 70, 210
%e A354951 5 11 5 66, 330, 462, 770, 2310
%t A354951 a[n_] := Count[Prime[n] * Divisors[Product[Prime[i], {i, 1, n - 1}]], _?(SquareFreeQ[#] && DivisorSigma[-1, #] > 2 &)]; Array[a, 15]
%Y A354951 Cf. A005117, A006530, A087248, A354950.
%K A354951 nonn,more
%O A354951 1,4
%A A354951 _Amiram Eldar_, Jun 13 2022