This site is supported by donations to The OEIS Foundation.

 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 A052002 Numbers with an odd number of partitions. 11

%I

%S 0,1,3,4,5,6,7,12,13,14,16,17,18,20,23,24,29,32,33,35,36,37,38,39,41,

%T 43,44,48,49,51,52,53,54,56,60,61,63,67,68,69,71,72,73,76,77,81,82,83,

%U 85,87,88,89,90,91,92,93,95,99,102,104,105,107,111,114,115,118,119,121

%N Numbers with an odd number of partitions.

%C A052003(n) = A000041(a(n+1)). - _Reinhard Zumkeller_, Nov 03 2015

%C Also, numbers having an odd number of partitions into distinct odd parts; that is, numbers m such that A000700(m) is odd. For example, 16 is in the list since 16 has 5 partitions into distinct odd parts, namely, 1 + 15, 3 + 13, 5 + 11, 7 + 9 and 1 + 3 + 5 + 7. See Formula section for a proof. - _Peter Bala_, Jan 22 2017

%H Clark Kimberling, <a href="/A052002/b052002.txt">Table of n, a(n) for n = 1..1000</a>

%H O. Kolberg, <a href="http://www.mscand.dk/article/view/10584/8605">Note on the parity of the partition function</a>, Math. Scand. 7 1959 377-378. MR0117213 (22 #7995).

%F From _Peter Bala_, Jan 22 2016: (Start)

%F Sum_{n>=0} x^a(n) = (1 + x)*(1 + x^3)*(1 + x^5)*... taken modulo 2. Proof: Product_{n>=1} 1 + x^(2*n-1) = Product_{n>=1} (1 - x^(4*n-2))/(1 - x^(2*n-1)) = Product_{n>=1} (1 - x^(2*n))*(1 - x^(4*n-2))/( (1 - x^(2*n)) * (1 - x^(2*n-1)) ) = ( 1 + 2*Sum_{n>=1} (-1)^n*x^(2*n^2) )/(Product_{n>=1} (1 - x^n)) == 1/( Product_{n>=1} (1 - x^n) ) (mod 2). (End)

%p N:= 1000: # to get all terms <= N

%p V:= Vector(N+1):

%p V[1]:= 1:

%p for i from 1 to (N+1)/2 do

%p V[2*i..N+1]:= V[2*i..N+1] + V[1..N-2*i+2] mod 2

%p od:

%p select(t -> V[t+1]=1, [\$1..N]); # _Robert Israel_, Jan 22 2017

%t f[n_, k_] := Select[Range[250], Mod[PartitionsP[#], n] == k &]

%t Table[f[2, k], {k, 0, 1}] (* _Clark Kimberling_, Jan 05 2014 *)

%o (PARI) for(n=0, 200, if(numbpart(n)%2==1, print1(n", "))) \\ _Altug Alkan_, Nov 02 2015

%o import Data.List (findIndices)

%o a052002 n = a052002_list !! (n-1)

%o a052002_list = findIndices odd a000041_list

%o -- _Reinhard Zumkeller_, Nov 03 2015

%Y Cf. A052003, A001560, A000041, A052001, A000700.

%K nonn,easy

%O 1,3

%A _Patrick De Geest_, Nov 15 1999

%E Offset corrected and b-file adjusted by _Reinhard Zumkeller_, Nov 03 2015

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recent | More pages
The OEIS Community | Maintained by The OEIS Foundation Inc.

Last modified March 20 13:57 EDT 2018. Contains 300985 sequences. (Running on oeis4.)