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 A258596 #11 Jun 19 2015 07:01:50 %S A258596 1,1,1,2,2,2,3,2,4,4,4,6,4,6,4,4,6,4,4,8,7,6,2,8,4,4,8,14,8,9,8,12,16, %T A258596 14,10,12,6,16,24,4,8,36,8,16,8,12,27,16,16,28,8,4,8,22,8,8,6,16,16, %U A258596 42,32,6,8,20,6,48,12,16,28,8,2,12,20,16,12,4,32 %N A258596 Number of divisors of the number of partitions of n into distinct parts, a(n) = A000005(A000009(n)). %C A258596 a(n) is odd for n = 0, 1, 2, 6, 20, 29, 46, ... ; see A035142. - _Michel Marcus_, Jun 19 2015 %H A258596 Giovanni Resta, <a href="/A258596/b258596.txt">Table of n, a(n) for n = 0..10000</a> %F A258596 a(n) = A000005(A000009(n)). %t A258596 DivisorSigma[0, PartitionsQ@ Range[0, 100]] %o A258596 (PARI) a(n) = numdiv(polcoeff(prod(k=1, n, 1 + x^k, 1 + x * O(x^n)), n)); \\ _Michel Marcus_, Jun 19 2015 %Y A258596 Cf. A000009, A085543. %K A258596 nonn %O A258596 0,4 %A A258596 _Giovanni Resta_, Jun 04 2015