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.

A162468 Integers n such that A000009(n) (the number of partitions of n into distinct parts) == 1 (mod n).

Original entry on oeis.org

1, 2, 11, 22, 92, 149, 6919, 25517, 45339, 146635, 167903, 7461583, 14809123, 75788157, 80012043
Offset: 1

Views

Author

Max Alekseyev, Jul 04 2009

Keywords

Comments

Integers n dividing A000009(n)-1.
No other terms below 10^8.

Crossrefs

Extensions

a(1)=1 prepended by Max Alekseyev, Dec 28 2011
a(13)-a(15) from Max Alekseyev, Jul 10 2015