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!)
A143117 a(n) = the smallest positive integer that divides no more than one integer k, where n-th prime <= k <= (n+1)th prime. 1
2, 2, 2, 3, 2, 3, 2, 3, 5, 2, 5, 3, 2, 3, 5, 4, 2, 4, 3, 2, 4, 3, 5, 7, 3, 2, 3, 2, 3, 8, 3, 5, 2, 6, 2, 5, 4, 3, 5, 4, 2, 6, 2, 3, 2, 9, 7, 3, 2, 3, 4, 2, 6, 5, 4, 5, 2, 5, 3, 2, 6, 10, 3, 2, 3, 9, 5, 6, 2, 3, 4, 7, 5, 4, 3, 5, 7, 3, 5, 6, 2, 6, 2, 4, 3, 5, 7, 3, 2, 3, 8, 7, 3, 5, 3, 5, 9, 2, 13, 4, 6, 4, 5, 2, 5 (list; graph; refs; listen; history; text; internal format)
OFFSET

1,1

LINKS

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

FORMULA

a(n) = A140715(n) + 1.

EXAMPLE

The 16th prime is 53 and the 17th prime is 59. So we will concern ourselves with the integers 53,54,55,56,57,58,59. 1 divides all these integers. 2 divides three of these integers (54,56,58). 3 divides 54 and 57. 4 divides just 56. So a(16) = 4.

CROSSREFS

Cf. A140715, A143118.

Sequence in context: A145193 A292585 A175872 * A076221 A029235 A289052

Adjacent sequences:  A143114 A143115 A143116 * A143118 A143119 A143120

KEYWORD

nonn

AUTHOR

Leroy Quet, Jul 25 2008

EXTENSIONS

Extended by Ray Chandler, Nov 10 2008

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 February 25 19:39 EST 2021. Contains 341618 sequences. (Running on oeis4.)