cp's OEIS Frontend

This is a front-end for the Online Encyclopedia of Integer Sequences, made by Christian Perfect. The idea is to provide OEIS entries in non-ancient HTML, and then to think about how they're presented visually. The source code is on GitHub.

Showing 1-2 of 2 results.

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).

Original entry on oeis.org

1, 5, 25, 42, 133, 618, 643, 701, 1962, 8150, 147458, 168459, 356038, 415870, 536685, 637757, 1093612, 1207618, 3368325, 3470706, 23400631, 37621653
Offset: 1

Views

Author

Robert G. Wilson v, Sep 02 2000

Keywords

Comments

No other terms below 10^8. - Max Alekseyev, Oct 12 2023

Crossrefs

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

Programs

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

Extensions

a(11)-a(18) from Sean A. Irvine, May 12 2022
a(19)-a(22) from Max Alekseyev, Oct 12 2023

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

Original entry on oeis.org

1, 8, 11, 34, 310, 1688, 2307, 2708, 13988, 21315, 46739, 426378, 771476, 11762557, 18628390, 19841526, 24396168, 85110245
Offset: 1

Views

Author

Robert G. Wilson v, Sep 02 2000

Keywords

Comments

No other terms below 10^8. - Max Alekseyev, Oct 12 2023

Crossrefs

Cf. A000009, A000041, A051177, A056848, A056872, A121919. A128836, A162468, A259943.

Programs

  • Mathematica
    Do[ If[ Mod[ PartitionsP[n] - PartitionsQ[n], n] == 0, Print[n]], {n, 1, 14577}]

Extensions

a(10)-a(13) from Sean A. Irvine, May 12 2022
a(14)-a(18) from Max Alekseyev, Oct 12 2023
Showing 1-2 of 2 results.

Started in 1964 by Neil J. A. Sloane | Maintained by The OEIS Foundation Inc.

Content is available under The OEIS End-User License Agreement.