login
This site is supported by donations to The OEIS Foundation.

 

Logo

Annual Appeal: Please make a donation (tax deductible in USA) to keep the OEIS running. Over 5000 articles have referenced us, often saying "we discovered this result with the help of the OEIS".

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

%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

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

%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 (Haskell)

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

%Y Cf. A052001.

%K nonn

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

License Agreements, Terms of Use, Privacy Policy .

Last modified December 2 21:20 EST 2016. Contains 278694 sequences.