The On-Line Encyclopedia of Integer Sequences (OEIS)

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

Revision History for A214737

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

A214737

Least m>0 such that n-m divides prime(n)+m.
(history; published version)

#5 by T. D. Noe at Tue Jul 31 18:55:11 EDT 2012

STATUS

proposed

approved

#4 by Clark Kimberling at Tue Jul 31 11:05:47 EDT 2012

STATUS

editing

proposed

#3 by Clark Kimberling at Sun Jul 29 14:09:15 EDT 2012

EXAMPLE

Write x\#y if x|y is false; then 9\#30, 8\#31, 7\#32, 6\#33, 5\#34, 4\#35, 3|#36, so a(10) = 7.

#2 by Clark Kimberling at Sat Jul 28 10:21:59 EDT 2012

NAME

allocated for Clark KimberlingLeast m>0 such that n-m divides prime(n)+m.

DATA

1, 1, 3, 1, 5, 1, 5, 1, 7, 4, 5, 4, 11, 13, 13, 13, 17, 17, 7, 19, 21, 21, 23, 23, 25, 1, 1, 6, 17, 29, 31, 16, 33, 12, 19, 35, 35, 37, 37, 19, 41, 4, 41, 23, 11, 4, 47, 3, 19, 47, 49, 4, 49, 3, 27, 55, 11, 3, 29, 18, 57, 26, 39, 2, 65, 65, 23, 17, 69, 18, 71, 18, 71, 73

OFFSET

2,3

LINKS

Clark Kimberling, <a href="/A214737/b214737.txt">Table of n, a(n) for n = 2..1000</a>

EXAMPLE

Write x\y if x|y is false; then 9\30, 8\31, 7\32, 6\33, 5\34, 4\35, 3|36, so a(10) = 7.

MATHEMATICA

Table[m = 1; While[! Divisible[Prime[n]+m, n - m], m++]; m, {n, 2, 100}]

CROSSREFS

Cf. A075861.

KEYWORD

allocated

nonn,easy

AUTHOR

Clark Kimberling, Jul 28 2012

STATUS

approved

editing

#1 by Clark Kimberling at Fri Jul 27 21:14:19 EDT 2012

NAME

allocated for Clark Kimberling

KEYWORD

allocated

STATUS

approved