login
This site is supported by donations to The OEIS Foundation.
Logo

Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A109905 a(n) = greatest prime of the form k*(n-k) +1. 0 if no such prime exists. 5
0, 2, 3, 5, 7, 0, 13, 17, 19, 17, 31, 37, 43, 41, 37, 61, 73, 73, 89, 101, 109, 113, 131, 109, 157, 89, 181, 197, 211, 0, 241, 257, 271, 281, 307, 181, 337, 353, 379, 401, 421, 433, 463, 449, 487, 521, 547, 577, 601, 617, 631, 677, 701, 0, 757, 769, 811, 761, 859, 757 (list; graph; refs; listen; history; internal format)
OFFSET

1,2

COMMENTS

k can take values from 1 to floor[n/2].

EXAMPLE

a(15) = 37 as 1*14 +1 = 16, 2*13 +1 = 27 are composite but 3*12 +1= 37 is a prime.

a(6) = 0 as 1*5 +1=6, 2*4 +1=9, 3*3 +1 = 10 are all composite.

PROG

(PARI) { a(n) = forstep(k=n\2, 1, -1, if(isprime(k*(n-k)+1), return(k*(n-k)+1))); return(0) } (Alekseyev)

CROSSREFS

Cf. A109904, A026728.

Sequence in context: A171013 A020919 A126053 * A113493 A060420 A077648

Adjacent sequences:  A109902 A109903 A109904 * A109906 A109907 A109908

KEYWORD

nonn

AUTHOR

Amarnath Murthy (amarnath_murthy(AT)yahoo.com), Jul 15 2005

EXTENSIONS

More terms from Max Alekseyev (maxale(AT)gmail.com), Oct 04 2005

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Transforms | Puzzles | Hot | Classics
Recent Additions | More pages | Superseeker | Maintained by The OEIS Foundation Inc.

Content is available under The OEIS End-User License Agreement .

Last modified February 17 04:58 EST 2012. Contains 205985 sequences.