login

Year-end appeal: Please make a donation to the OEIS Foundation to support ongoing development and maintenance of the OEIS. We are now in our 61st year, we have over 378,000 sequences, and we’ve reached 11,000 citations (which often say “discovered thanks to the OEIS”).

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

%I #14 Dec 03 2016 12:11:15

%S 1,2,11,22,92,149,6919,25517,45339,146635,167903,7461583,14809123,

%T 75788157,80012043

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

%C Integers n dividing A000009(n)-1.

%C No other terms below 10^8.

%H Eric Weisstein's World of Mathematics, <a href="http://mathworld.wolfram.com/PartitionFunctionQ.html">Partition Function Q</a>

%Y Cf. A000009, A056848, A128836, A259943

%K nonn,more

%O 1,2

%A _Max Alekseyev_, Jul 04 2009

%E a(1)=1 prepended by _Max Alekseyev_, Dec 28 2011

%E a(13)-a(15) from _Max Alekseyev_, Jul 10 2015