The OEIS is supported by the many generous donors to the OEIS Foundation.



Year-end appeal: Please make a donation to the OEIS Foundation to support ongoing development and maintenance of the OEIS. We are now in our 60th year, we have over 367,000 sequences, and we’ve reached 11,000 citations (which often say “discovered thanks to the OEIS”).

Other ways to Give
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A295369 Number of squarefree primitive abundant numbers (A071395) with n prime factors. 4
0, 0, 1, 18, 610, 216054, 12566567699 (list; graph; refs; listen; history; text; internal format)
Here primitive abundant number means an abundant number all of whose proper divisors are deficient numbers (A071395). The alternative definition (an abundant number having no abundant proper divisor, see A091191) would yield an infinite count for a(3): since 2*3 = 6 is perfect, all numbers of the kind 2*3*p with p > 3 would be primitive abundant.
See A287590 for the number of squarefree ODD primitive abundant numbers with n prime factors.
The actual numbers are listed in A298973. - M. F. Hasler, Feb 16 2018
Gianluca Amato, Maximilian F. Hasler, Giuseppe Melfi, Maurizio Parton, Primitive abundant and weird numbers with many prime factors, arXiv:1802.07178 [math.NT], 2018.
For n=3, the only squarefree primitive abundant number (SFPAN) is 2*5*7 = 70, which is also a primitive weird number, see A002975.
For n=4, the 18 SFPAN range from 2*5*11*13 = 1430 to 2*5*11*53 = 5830.
For n=5, the 610 SFPAN range from 3*5*7*11*13 = 15015 to 2*5*11*59*647 = 4199030.
A295369(n, p=1, m=1, sigmam=1) = {
my(centerm = sigmam/(2*m-sigmam), s=0);
if (n==1,
if (centerm > p, primepi(ceil(centerm)-1) - primepi(p), 0),
p = max(floor(centerm), p); while (0<c=A295369(n-1, p=nextprime(p+1), m*p, sigmam*(p+1)), s+=c); s
def A295369(n, p=1, m=1, sigmam=1):
centerm = sigmam/(2*m-sigmam)
if n==1:
return prime_pi(ceil(centerm)-1) - prime_pi(p) if centerm > p else 0
p = max(floor(centerm), p)
s = 0
while True:
p = next_prime(p)
c = A295369(n-1, p, m*p, sigmam*(p+1))
if c <= 0: return s
Cf. A071395 (primitive abundant numbers), A287590 (counts of odd SFPAN), A298973, A249242 (using A091191).
Sequence in context: A253826 A061079 A180822 * A350984 A281559 A166767
Gianluca Amato, Feb 12 2018

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recents
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy. .

Last modified December 9 09:12 EST 2023. Contains 367690 sequences. (Running on oeis4.)