The OEIS mourns the passing of Jim Simons and is grateful to the Simons Foundation for its support of research in many branches of science, including the OEIS.
login
The OEIS is supported by the many generous donors to the OEIS Foundation.

 

Logo
Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
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 (list; graph; refs; listen; history; text; internal format)
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.
LINKS
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
Sequence in context: A107863 A065866 A322406 * A332655 A156466 A304403
KEYWORD
nonn,more
AUTHOR
Amiram Eldar, Apr 16 2018
STATUS
approved

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 May 14 04:33 EDT 2024. Contains 372528 sequences. (Running on oeis4.)