Vincenzo Manto

A396876

Numbers m whose squarefree core equals the number of duplicated prime factors.

Created: 7/16/2026 | Author: Vincenzo Manto , James C. McMahon , and Michael De Vlieger , Jul 08 2026

This sequence has been cited by and influenced 1 other sequence

Official Comments

Numbers m such that bigomega(m) - omega(m) = core(m).
In other words, numbers m such that A001222(m) - A001221(m) = A046660(m) = A007913(m).
Squarefree numbers are naturally excluded since for any squarefree number m >= 1, bigomega(m) - omega(m) = 0, while core(m) = m >= 1.
The difference bigomega(m) - omega(m) is sometimes called the prime factor multiplicity index of m (A046660).
The set of prime squares A001248 is a proper subset since A046660(p^2) = 1 and core(p^2) = 1.
Of the 56250 terms m <= 2^40 in A286708 (powerful but not a prime power), 56220 are Achilles numbers and 30 are in A386762 (perfect powers of numbers neither squarefree nor powerful). Most of the terms in the intersection with A386762 are cubes except 380204032 = 2^10 * 13^5 and 21924480357 = 3^10 * 13^5.

Sequence Chart

Graph of A396876

Data

4,8,9,25,48,49,108,121,169,289,320,361,384,450,529,675,841,864,882,961,1323,1369,1681,1792,1849,1875,1944,2000,2178,2209,2450,2809,3042,3267,3481,3645,3721,4374,4489,4563,5041,5202,5329,6050,6241,6498,6889,7203,7803,7921

Computational Implementations

PYTHON

from math import prod
from sympy import factorint
def ok(m): return m > 1 and sum((d := factorint(m)).values()) - len(d) == prod(p for p, e in d.items() if e % 2)
print([m for m in range(1, 8000) if ok(m)])

CODE

isok(k) = my(f=factor(k)); core(f) == bigomega(f) - omega(f); \\ _Michel Marcus_, Jul 10 2026

Mathematica

core[x_] := Sqrt[x] /. (c_ : 1)*a_^(b_ : 0) :> (c*a^b)^2; Select[Range[8000], PrimeOmega[#] - PrimeNu[#] == core[#] &]

Cross-References

See also OEIS entries: Cf A001222 A001221 A007913 A396594 A397221 A046660 A001248