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.
%I A052003 #30 Apr 28 2022 22:29:37 %S A052003 1,3,5,7,11,15,77,101,135,231,297,385,627,1255,1575,4565,8349,10143, %T A052003 14883,17977,21637,26015,31185,44583,63261,75175,147273,173525,239943, %U A052003 281589,329931,386155,526823,966467,1121505,1505499,2679689,3087735 %N A052003 Odd partition numbers. %C A052003 Intersection of A005408 and A000041; A000035(a(n))*A167392(a(n)) = 1; a(n) = A000041(A052002(n+1)). - _Reinhard Zumkeller_, Nov 03 2015 %H A052003 Sean A. Irvine, <a href="/A052003/b052003.txt">Table of n, a(n) for n = 1..1000</a> (terms 1..529 from G. C. Gruebel). %H A052003 K. Ono, <a href="http://www.mathcs.emory.edu/~ono/publications-cv/pdfs/020.pdf">Odd values of the partition function</a> %H A052003 K. Ono, <a href="http://dx.doi.org/10.1016/S0012-365X(96)00117-3">Odd values of the partition function</a>, Discrete Mathematics 169, 1997, pp. 263-268. %p A052003 select(type, [seq(combinat:-numbpart(n),n=1..200)],odd); # _Robert Israel_, Nov 03 2015 %t A052003 Select[PartitionsP[Range[50]], OddQ] (* _Vladimir Reshetnikov_, Nov 02 2015 *) %o A052003 (PARI) for(n=1, 100, if((k=numbpart(n))%2==1, print1(k", "))) \\ _Altug Alkan_, Nov 02 2015 %o A052003 (Haskell) %o A052003 a052003 n = a052003_list !! n %o A052003 a052003_list = filter odd a000041_list %o A052003 -- _Reinhard Zumkeller_, Nov 03 2015 %Y A052003 Cf. A052002, A000041. %K A052003 nonn %O A052003 1,2 %A A052003 _Patrick De Geest_, Nov 15 1999