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 60th year, we have over 367,000 sequences, and we’ve reached 11,000 citations (which often say “discovered thanks to the OEIS”). Other ways to Give
 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 A056872 Numbers k such that k | p(k) + q(k) where p(k) = partition numbers (A000041) and q(k) = partition numbers into distinct parts (A000009). 1
 1, 5, 25, 42, 133, 618, 643, 701, 1962, 8150, 147458, 168459, 356038, 415870, 536685, 637757, 1093612, 1207618, 3368325, 3470706, 23400631, 37621653 (list; graph; refs; listen; history; text; internal format)
 OFFSET 1,2 COMMENTS No other terms below 10^8. - Max Alekseyev, Oct 12 2023 LINKS Table of n, a(n) for n=1..22. MATHEMATICA Do[ If[ Mod[ PartitionsP[ n ] + PartitionsQ[ n ], n ] == 0, Print[ n ] ], {n, 1, 8150} ] CROSSREFS Cf. A000009, A000041, A051177, A056848, A056873, A121919. A128836, A162468, A259943. Sequence in context: A250314 A293571 A294256 * A029490 A223654 A362092 Adjacent sequences: A056869 A056870 A056871 * A056873 A056874 A056875 KEYWORD nonn,more AUTHOR Robert G. Wilson v, Sep 02 2000 EXTENSIONS a(11)-a(18) from Sean A. Irvine, May 12 2022 a(19)-a(22) from Max Alekseyev, Oct 12 2023 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 16:44 EST 2023. Contains 367563 sequences. (Running on oeis4.)