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

 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 A358414 Smallest 4-abundant number (sigma(x) > 4x) which is not divisible by any of the first n primes. 5
 27720, 1853070540093840001956842537745897243375 (list; graph; refs; listen; history; text; internal format)
 OFFSET 0,1 COMMENTS Data copied from the Hi.gher. Space link where Mercurial, the Spectre calculated the terms. We have a(0) = 2^3*3^2*5*7*11 and a(1) = 3^5*5^3*7^2*11^2*13*...*89 ~ 1.85307*10^39. a(2) = 5^5*7^4*11^3*13^3*17^2*19^2*23^2*29^2*31^2*37^2*41*...*853 ~ 1.83947*10^370, a(3) = 7^5*11^3*13^3*17^3*19^3*23^2*...*97^2*101*...*4561 ~ 1.11116*10^1986, and a(4) = 11^4*13^4*17^3*19^3*23^3*29^3*31^3*37^2*...*181^2*191*...*18493 ~ 2.99931*10^8063 are too large to display. LINKS Jianing Song, Table of n, a(n) for n = 0..2 Mercurial, the Spectre, Abundant numbers coprime to n, Hi.gher. Space. EXAMPLE a(1) = A119240(4) = 1853070540093840001956842537745897243375 is the smallest 4-abundant odd number. a(2) = A358412(4) ~ 1.83947*10^370 is the smallest 4-abundant number that is coprime to 2 and 3. CROSSREFS Cf. A068404 (4-abundant numbers). Smallest k-abundant number which is not divisible by any of the first n primes: A047802 (k=2), A358413 (k=3), this sequence (k=4). Least p-rough number k such that sigma(k)/k >= n: A023199 (p=2), A119240 (p=3), A358412 (p=5), A358418 (p=7), A358419 (p=11). Sequence in context: A291458 A023943 A210161 * A096027 A249000 A058419 Adjacent sequences: A358411 A358412 A358413 * A358415 A358416 A358417 KEYWORD nonn,bref,hard AUTHOR Jianing Song, Nov 14 2022 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.

Last modified August 15 16:56 EDT 2024. Contains 375173 sequences. (Running on oeis4.)