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

Thanks to everyone who made a donation during our annual appeal!
To see the list of donors, or make a donation, see the OEIS Foundation home page.

 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 A125684 a(n) = numbers n such that A125683(n) is prime. 2
 3, 4, 5, 6, 7, 8, 10, 13, 14, 18, 21, 22, 26, 27, 28, 32, 33, 35, 51, 54, 58, 67, 76, 89, 100, 140, 170, 189, 269, 307, 365, 408, 470, 475, 546, 558, 604, 751, 771, 857, 892, 896, 992, 1031, 1080, 1181, 1228, 1289, 1342, 1465, 1483, 1491, 1520, 1525, 1571, 1620 (list; graph; refs; listen; history; text; internal format)
 OFFSET 1,1 COMMENTS A125683(n) = Numerator[ Sum[ (-1)^(k+1) * 1/(k(k+1)), {k,1,n} ]. Corresponding primes are listed in A125685(n) = A125683[ a(n) ] = {5,11,2,79,331,479,5297,70061,69203,8960447,45083347,...}. LINKS EXAMPLE A125683(n) begins {1,1,5,11,2,79,331,479,493,5297,2701,69071,70061,...}. Thus a(1) = 3 because A125683(3) = 5 is prime but A125683(k) is not prime for k<3. a(2)-a(6) = {4,5,6,7,8} because A125683(k) is prime for 3

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.

Last modified January 23 19:36 EST 2020. Contains 331175 sequences. (Running on oeis4.)