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 A054685 #26 Nov 02 2023 12:30:04 %S A054685 1,0,1,1,1,2,1,3,2,4,3,5,5,6,7,7,10,9,12,12,15,15,18,19,22,24,26,30, %T A054685 32,36,39,43,48,51,57,61,68,73,79,87,93,103,108,121,127,140,148,162, %U A054685 173,187,200,215,232,247,266,283,306,324,348,371,397,423,450,480,512,543,579,614 %N A054685 Number of partitions of n into distinct prime powers (1 not considered a power). %H A054685 Reinhard Zumkeller, <a href="/A054685/b054685.txt">Table of n, a(n) for n = 0..10000</a> (first 1000 terms from T. D. Noe) %F A054685 G.f.: Product_{p prime} Product_{k >= 1} (1 + x^(p^k)). %t A054685 CoefficientList[Series[Product[Product[1 +x^(Prime[n]^k), {k, 1, 9}], {n, 1, 25}], {x, 0, 100}], x] (* _G. C. Greubel_, May 09 2019 *) %o A054685 (Haskell) %o A054685 import Data.MemoCombinators (memo2, integral) %o A054685 a054685 n = a054685_list !! n %o A054685 a054685_list = map (p' 2) [0..] where %o A054685 p' = memo2 integral integral p %o A054685 p _ 0 = 1 %o A054685 p k m = if m < pp then 0 else p' (k + 1) (m - pp) + p' (k + 1) m %o A054685 where pp = a000961 k %o A054685 -- _Reinhard Zumkeller_, Nov 23 2015 %Y A054685 Cf. A051613. %Y A054685 Cf. A106244. %Y A054685 Cf. A000961. %K A054685 nonn %O A054685 0,6 %A A054685 _David W. Wilson_, Apr 19 2000