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.

A056848 Numbers k that divide the number of partitions of k into distinct parts (A000009).

Original entry on oeis.org

1, 10, 16, 65, 160, 180, 366, 406, 896, 1436, 3904, 5464, 6312, 7168, 12558, 17957, 36960, 48097, 48256, 61952, 88646, 94400, 107340, 112240, 114863, 127540, 171856, 270336, 383360, 392736, 459012, 623639, 960484, 1222656, 1312768, 1463990, 1480704, 2244736, 2380968, 3183563, 4161888, 4787280, 5107455, 5606400, 6826556, 7878400, 9188414, 9533238, 10219520, 10356472, 12981760, 15162808, 22062080, 25240360, 28313472, 32215040, 41284864, 72160576, 79563520, 91164167
Offset: 1

Views

Author

Robert G. Wilson v, Sep 02 2000

Keywords

Comments

No other terms below 10^8. - Max Alekseyev, Jul 10 2015

Crossrefs

Programs

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

Extensions

Extended by Max Alekseyev, Jul 04 2009
a(49)-a(60) from Max Alekseyev, Jul 10 2015