The On-Line Encyclopedia of Integer Sequences (OEIS)

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

Revision History for A240474

(Bold, blue-underlined text is an addition; faded, red-underlined text is a ~~deletion~~.)
Showing all changes.

A240474

Distance from prime(n) to the closest larger squarefree number.
(history; published version)

#8 by Ralf Stephan at Mon Apr 28 02:45:50 EDT 2014

STATUS

proposed

approved

#7 by Michel Marcus at Thu Apr 10 14:53:17 EDT 2014

STATUS

editing

proposed

#6 by Michel Marcus at Thu Apr 10 14:53:08 EDT 2014

FORMULA

a(n) = A112926(n) - A000040(n). - Michel Marcus, Apr 10 2014

STATUS

proposed

editing

#5 by Wesley Ivan Hurt at Sun Apr 06 21:17:31 EDT 2014

STATUS

editing

proposed

#4 by Wesley Ivan Hurt at Sun Apr 06 21:17:25 EDT 2014

CROSSREFS

Cf. A000040, A112926, A166003, A176141, A240473, A240475, A240476.

STATUS

proposed

editing

#3 by Chris Boyd at Sun Apr 06 15:35:02 EDT 2014

STATUS

editing

proposed

#2 by Chris Boyd at Sun Apr 06 13:03:24 EDT 2014

NAME

allocated for Chris BoydDistance from prime(n) to the closest larger squarefree number.

DATA

1, 2, 1, 3, 2, 1, 2, 2, 3, 1, 2, 1, 1, 3, 4, 2, 2, 1, 2, 2, 1, 3, 2, 2, 4, 1, 2, 2, 1, 1, 2, 2, 1, 2, 2, 3, 1, 2, 3, 1, 2, 1, 2, 1, 2, 2, 2, 3, 2, 1, 2, 2, 5, 2, 1, 2, 2, 2, 1, 1, 2, 2, 2, 2, 1, 1, 3, 2, 2, 4, 1, 3, 3, 1, 2, 2, 1, 1, 1, 1, 2, 1, 2, 1, 3, 2

OFFSET

1,2

LINKS

Chris Boyd, <a href="/A240474/b240474.txt">Table of n, a(n) for n = 1..10000</a>

EXAMPLE

a(9) = 3 because 3 is the gap between prime(9) = 23 and the closest larger squarefree number 26.

PROG

(PARI) forprime(p=1, 450, for(j=p+1, 2*p, if(issquarefree(j), print1(j-p", "); break)))

CROSSREFS

Cf. A000040, A112926, A166003, A176141, A240473, A240475, A240476

KEYWORD

allocated

nonn

AUTHOR

Chris Boyd, Apr 06 2014

STATUS

approved

editing

#1 by Chris Boyd at Sun Apr 06 12:38:48 EDT 2014

NAME

allocated for Chris Boyd

KEYWORD

allocated

STATUS

approved