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 A024939 #14 Aug 28 2016 18:23:37
%S A024939 1,0,0,1,0,1,0,1,1,0,1,1,1,1,1,1,2,1,2,2,2,2,2,3,3,2,3,3,3,4,3,5,4,4,
%T A024939 5,5,6,6,5,7,7,7,8,8,9,8,9,11,11,10,12,12,13,14,14,16,15,16,17,19,20,
%U A024939 20,20,22,24,23,26,27,27,28,30,33,34,34,36,37,40,41,43,46,46,47,50,55,56,56
%N A024939 Number of partitions of n into distinct odd primes.
%H A024939 T. D. Noe, <a href="/A024939/b024939.txt">Table of n, a(n) for n = 0..1000</a>
%F A024939 G.f.: Product_{k>1} (1+x^prime(k)).
%o A024939 (Haskell)
%o A024939 a024939 = p a065091_list where
%o A024939 p _ 0 = 1
%o A024939 p (k:ks) m = if m < k then 0 else p ks (m - k) + p ks m
%o A024939 -- _Reinhard Zumkeller_, Aug 05 2012
%Y A024939 Cf. A024937.
%Y A024939 Cf. A099773, A000586.
%K A024939 nonn
%O A024939 0,17
%A A024939 _Clark Kimberling_
%E A024939 Corrected and extended by _Vladeta Jovovic_, Jul 20 2003