login
The OEIS Foundation is supported by donations from users of the OEIS and by a grant from the Simons Foundation.

 

Logo


Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A294528 a(n) is the smallest prime that begins a run of exactly n consecutive numbers having 2, 4, ..., 2*n divisors. 6
2, 5, 61, 421, 1524085621 (list; graph; refs; listen; history; text; internal format)
OFFSET

1,1

COMMENTS

No such run exists for any n > 5; for a proof, see Links.

LINKS

Table of n, a(n) for n=1..5.

Jon E. Schoenfield, A proof that a(5) is the final term of this sequence

EXAMPLE

a(3) = 61 because 61 (prime), 62 = 2*31, and 63 = 3^2*7 have 2, 4, and 6 divisors, respectively (and 64 does not have exactly 8 divisors, so 63 is the last number in the run), and there is no smaller number having this property.

a(5) = 1524085621 because the 5 consecutive integers 1524085621..1524085625 have 2, 4, 6, 8, and 10 divisors, respectively (and 1524085626 does not have exactly 12 divisors), and there is no smaller number having this property.

CROSSREFS

Cf. A075028, A284596, A341213.

Sequence in context: A030244 A004150 A062642 * A093484 A250195 A041069

Adjacent sequences:  A294525 A294526 A294527 * A294529 A294530 A294531

KEYWORD

nonn,fini,full

AUTHOR

Jon E. Schoenfield, Nov 01 2017

STATUS

approved

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recent
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy. .

Last modified October 26 14:28 EDT 2021. Contains 348267 sequences. (Running on oeis4.)