The OEIS mourns the passing of Jim Simons and is grateful to the Simons Foundation for its support of research in many branches of science, including the OEIS.
The OEIS is supported by the many generous donors to the OEIS Foundation.

 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 A248354 Least positive integer m such that m + n divides prime(m^2) + prime(n^2). 1
 1, 1, 2, 1, 3, 8, 2, 6, 6, 45, 9, 4, 15, 2, 13, 17, 4, 12, 9, 8, 11, 6, 101, 20, 2, 15, 7, 50, 4, 183, 48, 15, 9, 5, 4, 4, 157, 1, 123, 4, 13, 112, 76, 4, 7, 13, 44, 2, 16, 28, 83, 202, 114, 50, 85, 31, 14, 62, 19, 25 (list; graph; refs; listen; history; text; internal format)
 OFFSET 1,3 COMMENTS Conjecture: a(n) exists for any n > 0. Moreover, a(n) <= n*(n-1)/2 for all n > 1. See also the comments in A248052. LINKS Zhi-Wei Sun, Table of n, a(n) for n = 1..10000 EXAMPLE a(3) = 2 since 2 + 3 = 5 divides prime(2^2) + prime(3^2) = 7 + 23 = 30. MATHEMATICA Do[m = 1; Label[aa]; If[Mod[Prime[m^2] + Prime[n^2], m + n] == 0, Print[n, " ", m]; Goto[bb]]; m = m + 1; Goto[aa]; Label[bb]; Continue, {n, 1, 60}] PROG (PARI) a(n)=my(N=prime(n^2), m); while((prime(m++^2)+N)%(m+n), ); m \\ Charles R Greathouse IV, Oct 05 2014 CROSSREFS Cf. A000040, A000290, A011757, A247824, A247975, A248052. Sequence in context: A057740 A320875 A265891 * A260142 A194505 A137307 Adjacent sequences: A248351 A248352 A248353 * A248355 A248356 A248357 KEYWORD nonn AUTHOR Zhi-Wei Sun, Oct 05 2014 STATUS approved

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recents
The OEIS Community | Maintained by The OEIS Foundation Inc.

Last modified May 21 11:30 EDT 2024. Contains 372736 sequences. (Running on oeis4.)