login
This site is supported by donations to The OEIS Foundation.

 

Logo

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!)
A056872 Numbers n such that n | p(n) + q(n) where p(n) = partition numbers (A000041) and q(n) = partition numbers into distinct parts (A000009). 0
1, 5, 25, 42, 133, 618, 643, 701, 1962, 8150 (list; graph; refs; listen; history; text; internal format)
OFFSET

1,2

LINKS

Table of n, a(n) for n=1..10.

MATHEMATICA

Do[ If[ Mod[ PartitionsP[ n ] + PartitionsQ[ n ], n ] == 0, Print[ n ] ], {n, 1, 8150} ]

CROSSREFS

Cf. A000041 and A000009.

Sequence in context: A250314 A293571 A294256 * A029490 A223654 A098947

Adjacent sequences:  A056869 A056870 A056871 * A056873 A056874 A056875

KEYWORD

nonn

AUTHOR

Robert G. Wilson v, Sep 02 2000

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.

License Agreements, Terms of Use, Privacy Policy. .

Last modified January 20 14:13 EST 2019. Contains 319333 sequences. (Running on oeis4.)