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

 

Logo

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 59th year, we have over 358,000 sequences, and we’ve crossed 10,300 citations (which often say “discovered thanks to the OEIS”).

Other ways to Give
Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A089016 Largest n-round number. 3
2, 30, 1260, 60060, 2042040, 446185740, 25878772920, 7420738134810, 304250263527210, 52331045326680120, 9223346738827371150, 1922760350154212639070, 469153525437627883933080 (list; graph; refs; listen; history; text; internal format)
OFFSET

0,1

COMMENTS

A positive integer m is said to be n-round if it is divisible by all primes p satisfying p^(n+1) < m, or equivalently if all positive integers t < m satisfying GCD(t,m)=1 are divisible by at most n primes (counting multiplicities). Using the fact that p_(t+1)<2*p_t (p_t the (t)th prime) it is easy to prove that there are only finitely many n-round numbers for each n. 1-round numbers are usually called very round (A048597).

LINKS

T. D. Noe, Table of n, a(n) for n=0..100

EXAMPLE

a(4)=2042040 as follows. Certainly it is 4-round since it is <= 19^5 and divisible by all primes < 19. Also it is > 17^5, hence the largest 4-round number must be a multiple of 510510 = 2.3.5.7.11.13.17. But no 4-round number can be > 19^5 (since it is easy to prove that if p is a prime >= 19 and q is the next prime after p then 2.3.5....p > q^5 ). Thus 2042040, being the largest multiple of 510510 which is <= 19^5, must be the largest 4-round number.

MATHEMATICA

Table[k=1; While[prod=Times@@Prime[Range[k]]; prod<Prime[k+1]^(n+1), k++ ]; prod=prod/Prime[k]; prod*Floor[Prime[k]^(n+1)/prod], {n, 0, 100}] (* T. D. Noe, Sep 21 2006 *)

CROSSREFS

Cf. A048597, A122936 (2-round numbers), A122937 (3-round numbers).

Sequence in context: A350719 A140174 A246741 * A262004 A132104 A208093

Adjacent sequences: A089013 A089014 A089015 * A089017 A089018 A089019

KEYWORD

easy,nonn

AUTHOR

Paul Boddington, Nov 04 2003

EXTENSIONS

More terms from T. D. Noe, Sep 21 2006

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 November 28 02:51 EST 2022. Contains 358406 sequences. (Running on oeis4.)