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

 

Logo
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

%I #15 Oct 12 2023 08:56:24

%S 1,5,25,42,133,618,643,701,1962,8150,147458,168459,356038,415870,

%T 536685,637757,1093612,1207618,3368325,3470706,23400631,37621653

%N Numbers k such that k | p(k) + q(k) where p(k) = partition numbers (A000041) and q(k) = partition numbers into distinct parts (A000009).

%C No other terms below 10^8. - _Max Alekseyev_, Oct 12 2023

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

%Y Cf. A000009, A000041, A051177, A056848, A056873, A121919. A128836, A162468, A259943.

%K nonn,more

%O 1,2

%A _Robert G. Wilson v_, Sep 02 2000

%E a(11)-a(18) from _Sean A. Irvine_, May 12 2022

%E a(19)-a(22) from _Max Alekseyev_, Oct 12 2023

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.

License Agreements, Terms of Use, Privacy Policy. .

Last modified April 25 01:35 EDT 2024. Contains 371964 sequences. (Running on oeis4.)