login

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 61st year, we have over 378,000 sequences, and we’ve reached 11,000 citations (which often say “discovered thanks to the OEIS”).

A302935
Unitary highly composite deficient numbers: unitary deficient numbers k whose number of unitary divisors ud(k) > ud(m) for all unitary deficient numbers m < k.
0
1, 2, 10, 84, 1155, 25740, 471240, 14549535, 535422888
OFFSET
1,2
COMMENTS
The record numbers of unitary divisors are 1, 2, 4, 8, 16, 32, 64, 128, 256, ...
The unitary version of A302934.
MATHEMATICA
usigma[n_] := If[n == 1, 1, Times @@ (1 + Power @@@ FactorInteger[n])]; udiv[n_] := 2^PrimeNu[n]; dm = 0; Do[sig = usigma[n]; If[sig >= 2 n, Continue[]]; d = udiv[n]; If[d > dm, Print[n]; dm = d], {n, 1, 1000000000}]
PROG
(PARI) nbud(n) = 1<<omega(n);
usigma(n) = sumdiv(n, d, if(gcd(d, n/d)==1, d));
lista(nn) = {my(maxd = 0); for(n=1, nn, if ((usigma(n) < 2*n) && (nbud(n) > maxd), print1(n, ", "); maxd = nbud(n); ); ); } \\ Michel Marcus, Apr 17 2018
CROSSREFS
KEYWORD
nonn,more
AUTHOR
Amiram Eldar, Apr 16 2018
STATUS
approved