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

 Year-end appeal: Please make a donation to the OEIS Foundation to support ongoing development and maintenance of the OEIS. We are now in our 59th year, we have over 358,000 sequences, and we’ve crossed 10,300 citations (which often say “discovered thanks to the OEIS”). Other ways to Give
 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 A248143 Least integer m > 0 such that m + n divides p(m) + p(n), where p(.) is the partition function given by A000041. 3
 1, 1, 1, 61, 13, 7, 1, 25, 109, 41, 60, 1, 5, 24, 18, 6, 3, 7, 38, 12, 86, 31, 18, 14, 8, 96, 470, 2, 37, 245, 8, 6, 37, 2, 20, 137, 3, 19, 24, 63, 10, 99, 52, 32, 16, 638, 15, 20, 61, 45, 288, 43, 52, 12, 371, 123, 94, 8, 483, 11 (list; graph; refs; listen; history; text; internal format)
 OFFSET 1,4 COMMENTS Conjecture: a(n) exists for any n > 0. LINKS Zhi-Wei Sun, Table of n, a(n) for n = 1..765 EXAMPLE a(5) = 13 since 5 + 13 = 18 divides p(5) + p(13) = 7 + 101 = 108. MATHEMATICA Do[m=1; Label[aa]; If[Mod[PartitionsP[m]+PartitionsP[n], m+n]==0, Print[n, " ", m]; Goto[bb]]; m=m+1; Goto[aa]; Label[bb]; Continue, {n, 1, 60}] CROSSREFS Cf. A000041, A247824, A247937, A247940, A248124, A248125, A248133, A248136, A248137, A248139, A248142, A248144. Sequence in context: A106426 A106416 A224730 * A012860 A002108 A087409 Adjacent sequences: A248140 A248141 A248142 * A248144 A248145 A248146 KEYWORD nonn AUTHOR Zhi-Wei Sun, Oct 02 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 December 4 11:13 EST 2022. Contains 358556 sequences. (Running on oeis4.)