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

 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 A077338 a(n) = smallest multiple of prime(n) such that a(n) +1 is a multiple of prime(n+1). 5
 2, 9, 20, 21, 77, 169, 170, 114, 115, 464, 961, 1147, 902, 516, 423, 530, 1829, 3416, 1206, 2627, 4818, 1659, 1245, 7565, 7372, 5252, 2781, 5885, 9265, 13334, 4191, 3013, 9590, 2085, 11324, 19781, 21352, 6846, 4843, 5190, 16289, 31132, 18527, 28564 (list; graph; refs; listen; history; text; internal format)
 OFFSET 1,1 LINKS Amiram Eldar, Table of n, a(n) for n = 1..10000 EXAMPLE a(5) = 77 as prime(5) = 11,77 = 11*7 and 78 = 6*13= a multiple of prime(6). MATHEMATICA Do[k = 1; While[Mod[k*Prime[n] + 1, Prime[n+1]] != 0, k++ ]; Print[k*Prime[n]], {n, 1, 50}] (* Ryan Propper, Jul 09 2005 *) CROSSREFS Sequence in context: A038249 A116014 A090939 * A047883 A042915 A007115 Adjacent sequences:  A077335 A077336 A077337 * A077339 A077340 A077341 KEYWORD nonn AUTHOR Amarnath Murthy, Nov 04 2002 EXTENSIONS More terms from Ryan Propper, Jul 09 2005 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.

Last modified May 7 20:36 EDT 2021. Contains 343652 sequences. (Running on oeis4.)