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

This page as a plain text file.
%I A162468 #15 Feb 16 2025 08:33:11
%S A162468 1,2,11,22,92,149,6919,25517,45339,146635,167903,7461583,14809123,
%T A162468 75788157,80012043
%N A162468 Integers n such that A000009(n) (the number of partitions of n into distinct parts) == 1 (mod n).
%C A162468 Integers n dividing A000009(n)-1.
%C A162468 No other terms below 10^8.
%H A162468 Eric Weisstein's World of Mathematics, <a href="https://mathworld.wolfram.com/PartitionFunctionQ.html">Partition Function Q</a>
%Y A162468 Cf. A000009, A056848, A128836, A259943
%K A162468 nonn,more
%O A162468 1,2
%A A162468 _Max Alekseyev_, Jul 04 2009
%E A162468 a(1)=1 prepended by _Max Alekseyev_, Dec 28 2011
%E A162468 a(13)-a(15) from _Max Alekseyev_, Jul 10 2015