Parity of number of partitions of an integer

[benoit]

I found this 1995 on-line paper :

   
http://www.ams.org/era/1995-01-01/S1079-6762-95-01005-5/S1079-6762-95- 
01005-5.pdf.

Benoit Cloitre

> I haven't looked at these papers:
>
> 89j:11100 Hirschhorn, M. D.; Subbarao, M. V.
> On the parity of $p(n)$.
> Acta Arith.  50  (1988),  no. 4, 355--356.
>
> 93j:11068 Hirschhorn, M. D.
> On the parity of $p(n)$. II.  J. Combin.
> Theory Ser. A  62  (1993),  no. 1, 128--138.
>
> Evidently one should also look at MR 8, 566g, Gupta;
> MR 11, 13d, Majumdar; MR 22#6778, Morris Newman;
> MR 22#7995, Kolberg -- p(n) is both odd and even
> infinitely often; MR 25#3892, Newman;
> MR 50#9823, Subbarao; MR 82d::10025, Hirschhorn;
> MR 87k:11113, Blecksmith, Brillhart,Gerst;
>
> R.
>
> On Wed, 3 Sep 2003, John Conway wrote:
>
>> On Wed, 3 Sep 2003, Brendan McKay wrote:
>>
>>> Is there a formula for the parity of the number of partitions
>>> of an integer?  It is A040051.
>>
>>    This is an old question, to which nobody seems to have found even
>> a partial answer - a bit surprising in view of the fact that there
>> are simple infinite sequences of numbers for which we know the
>> value of  p(n)  modulo 5 or 7 or 11.
>>
>>       John Conway
>>
>
-------------- next part --------------
A non-text attachment was scrubbed...
Name: not available
Type: text/enriched
Size: 1338 bytes
Desc: not available
URL: <http://list.seqfan.eu/pipermail/seqfan/attachments/20030904/504c9a3a/attachment-0001.bin>