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!)
A199970 a(n) = the smallest number m with the smallest non-divisor n such that 1<n<m, or 0 if no such m exists. 15
0, 3, 4, 6, 12, 0, 60, 420, 840, 0, 2520, 0, 27720, 0, 0, 360360, 720720, 0, 12252240, 0, 0, 0, 232792560, 0, 5354228880 (list; graph; refs; listen; history; text; internal format)
OFFSET
1,2
LINKS
FORMULA
a(n) > 0 for prime powers n = p^k (p prime, k >= 0) else 0.
EXAMPLE
a(7) = 60 because 60 is the smallest number such that numbers k < 7 divides 60 but number 7 is not divisor of 60.
CROSSREFS
Sequence in context: A192813 A048229 A002090 * A283738 A366535 A368469
KEYWORD
nonn
AUTHOR
Jaroslav Krizek, Nov 26 2011
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 16 05:56 EDT 2024. Contains 372549 sequences. (Running on oeis4.)